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...") |
(No difference)
|
Revision as of 21:42, 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 [An optimal lower bound on the number of variables for graph identification | http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.4863&rep=rep1&type=pdf]
