6 citations · 13 across the 3 of their papers we have counts for
1 paper · 2 filters
Eric Allender, Joshua A. Grochow, Dieter van Melkebeek +2
It is well-known [KST93] that the complexity of the Graph Automorphism problem is characterized by a special case of Graph Isomorphism, where the input graphs satisfy the "promise"…