Bounded color multiplicity graph isomorphism is in the #L hierarchy

In this paper we study the complexity of bounded color multiplicity graph isomorphism BCGI/sub b/: the input is a pair of vertex-colored graphs such that the number of vertices of a given color in an input graph is bounded by b. We show that BCGI/sub b/ is in the #L hierarchy (more precisely, the Mod/sub k/L hierarchy for some constant k depending on b). Combined with the fact that bounded color multiplicity graph isomorphism is logspace many-one hard for every set in the Mod/sub k/L hierarchy for any constant k, we get a tight classification of the problem using logspace-bounded counting classes.

[1]  Eric Allender,et al.  The complexity of matrix rank and feasible systems of linear equations , 1999, computational complexity.

[2]  Seinosuke Toda.  Counting Problems Computationally Equivalent to Computing the Determinant , 1991 .

[3]  Eugene M. Luks.  Computing the composition factors of a permutation group in polynomial time , 1987, Comb..

[4]  O. H. Lowry.  Academic press. , 1972, Analytical chemistry.

[5]  Pierre McKenzie,et al.  Parallel Algorithms for Solvable Permutation Groups , 1988, J. Comput. Syst. Sci..

[6]  Stephen A. Cook,et al.  The Parallel Complexity of Abelian Permutation Group Problems , 1987, SIAM J. Comput..

[7]  Eugene M. Luks,et al.  Parallel algorithms for permutation groups and graph isomorphism , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  V Vinay.  Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[9]  Christoph Meinel,et al.  Structure and Importance of Logspace-MOD-Classes , 1991, STACS.

[10]  H. Wielandt,et al.  Finite Permutation Groups , 1964 .

[11]  Jacobo Torán,et al.  On the hardness of graph isomorphism , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[12]  Eugene M. Luks,et al.  Permutation Groups and Polynomial-Time Computation , 1996, Groups And Computation.

[13]  Eric Allender,et al.  Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds , 1999, J. Comput. Syst. Sci..

[14]  L. Babai.  Monte-Carlo algorithms in graph isomorphism testing , 2006 .

[15]  John E. Hopcroft,et al.  Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[16]  Christoph Meinel,et al.  Structure and importance of logspace-MOD class , 1992, Mathematical systems theory.

[17]  Janos Simon,et al.  Space-bounded hierarchies and probabilistic computations , 1982, STOC '82.

[18]  Eric Allender,et al.  Relationships Among PL, #L, and the Determinant , 1996, RAIRO Theor. Informatics Appl..

[19]  E. Allender.  Arithmetic Circuits and Counting Complexity Classes , 2004 .

[20]  Eric Allender,et al.  Relationships among PL, #L, and the determinant , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[21]  Janos Simon,et al.  Space-Bounded Hierarchies and Probabilistic Computations , 1984, J. Comput. Syst. Sci..

[22]  Jacobo Torán,et al.  Completeness results for graph isomorphism , 2003, J. Comput. Syst. Sci..

[23]  Jacobo Torán,et al.  Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566] , 2006, Journal of computer and system sciences (Print).