Abstract

We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every logarithmic space modular class ModkL 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.

Citations

217	Nondeterministic space is closed under complement - Immerman - 1988
210	Computational complexity of probabilistic Turing machines - Gill - 1977
192	A taxonomy of problems with fast parallel algorithms - Cook - 1985
154	P = BPP if E requires exponential circuits: Derandomizing the XOR lemma - Impagliazzo, Wigderson - 1997
140	Matching is as easy as matrix inversion - Mulmuley, Vazirani, et al. - 1987
139	On uniform circuit complexity - Ruzzo - 1981
119	An Optimal Lower Bound on the Number of Variables for Graph Identi cation - Cai, Furer, et al. - 1989
104	On uniformity within NC 1 - Barrington, Immerman, et al. - 1990
103	The method of forced enumeration for nondeterministic automata - Szelepcsényi - 1988
101	Does co-NP have short interactive proofs - Boppana, H˚astad, et al. - 1987
92	Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses - Klivans, Melkebeek
56	Canonical labeling of graphs - Babai, Luks - 1983
51	The Graph Isomorphism Problem - Köbler, Schöning, et al. - 1993
49	Graph isomorphism is in the low hierarchy - Schöning - 1988
45	A very hard log-space counting class - Álvarez, Jenner - 1993
43	Space-bounded hierarchies and probabilistic computations - Ruzzo, Simon, et al. - 1984
39	Lower bounds for monotone span programs - Beimel, Gál, et al. - 1997
39	Constructing a Perfect Matching is in RandomNC - Karp, Upfal, et al. - 1985
37	Symmetric space-bounded computation - Lewis, Papadimitriou - 1982
36	Structure and importance of logspace-MOD-classes - Buntrock, Hertrampf, et al. - 1991
36	A note on the graph isomorphism counting problem - Mathon - 1979
33	V.V.: Matching is as easy as matrix inversion. Combinatorica 7 - Mulmuley, Vazirani, et al. - 1987
23	Symmetric logspace is closed under complement - Nisan, Ta-Shma - 1995
23	Uniform constant-depth threshold circuits for division and iterated multiplication - Hesse, Allender, et al.
21	Isomorphism of bounded valence can be tested in polynomial time - Luks - 1982
20	Isomorphism of graphs with bounded eigenvalue multiplicity - Babai, Grigoryev, et al. - 1982
17	Isolating, matching, and counting: uniform and nonuniform upper bounds - Allender, Reinhardt, et al. - 1999
17	A V 2 algorithm for determining isomorphism of planar graphs - Hopcroft, Tarjan - 1971
16	A logspace algorithm for tree canonization - Lindell - 1992
15	Division is in Uniform TC 0 - Hesse - 2001
14	Parallel algorithms for permutation groups and graph isomorphism - Luks - 1986
13	Uniform circuits for division: consequences and problems - Allender, Barrington - 2000
13	Alogtime algorithms for tree isomorphism, comparison, and canonization - Buss - 1997
12	Relationships among PL - Allender, Ogihara - 1996
11	A very hard log-space counting class, Theoret - Álvarez, Jenner - 1993
11	Completeness results for graph isomorphism - Jenner, Kobler, et al. - 2003
9	Relationships among - Allender, Ogihara - 1996
8	The parallel complexity of Abelian permutation group problems - McKenzie, Cook - 1987
8	Complexity of Parallel Arithmetic Using the Chinese Remainder Representation - Chiu
7	A note on the hardness of tree isomorphism - Jenner, McKenzie, et al. - 1998
5	The division breakthroughs - Allender
4	Melkebeek, Graph Isomorphism has subexponential size provers unless the polynomial time hierarchy collapses - Klivans, van - 1999
3	Tarjan, A V 2 algorithm for determining isomorphism of planar graphs - Hopcroft, E - 1971
2	The Graph Isomorphism - Köbler, Schöning, et al. - 1993
2	The complexity of graph isomorphism for colored graphs with color classes of size 2 and 3 - Kobler, Toran - 2002
1	Constructing a perfect matching is in random NC. Combinatorica 6:35--48 - Karp, Upfal, et al. - 1986
1	Division in logspace uniform NC 1 - Chiu, Davida, et al.