Graph isomorphism: Physical resources, optimization models, and algebraic characterizations

Laura Mančinska, David E. Roberson, Antonios Varvitsiotis

In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$,…