Answers are grounded in this paper and cite their sources.
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC{⁰} many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every logarithmic space modular class {Mod}ₖL and for the class DET of problems NC{¹} reducible to the determinant. These are the strongest known hardness results for the graph isomorphism problem and imply a randomized logarithmic space reduction from the perfect matching problem to graph isomorphism. We also investigate hardness results for the graph automorphism problem.
No takes yet. Share an insight, caveat, or question.
Jacobo Torán (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: