Difference between revisions of "Meeting notes 11 04 20"
From Quantum Computing Theory Group
(Created page with "David R discussed his new problem for isomorphism of exponentially large graphs. He began by describing the gadget description of Cai, Furer, Immerman [An optimal lower bound on...") |
|||
| Line 1: | Line 1: | ||
David R discussed his new problem for isomorphism of exponentially large graphs. | David R discussed his new problem for isomorphism of exponentially large graphs. | ||
| − | He began by describing the gadget description of Cai, Furer, Immerman [ | + | He began by describing the gadget description of Cai, Furer, Immerman [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.4863&rep=rep1&type=pdf|An optimal lower bound on the number of variables for graph identification] |
Revision as of 21:44, 20 April 2011
David R discussed his new problem for isomorphism of exponentially large graphs.
He began by describing the gadget description of Cai, Furer, Immerman optimal lower bound on the number of variables for graph identification
