Meeting notes 11 04 20
From Quantum Computing Theory Group
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
