Abstract
We give a new upper bound for the Group and Quasigroup Isomorphism problems when the input structures are given explicitly by multiplication tables. We show that these problems can be computed by polynomial size nondeterministic circuits of unbounded fan-in with O(log log n) depth and O(log2 n) nondeterministic bits, where n is the number of group elements. This improves the existing upper bound for the problems. In the previous bound the circuits have bounded fan-in but depth O(log2 n) and also O(log2 n) nondeterministic bits. We then prove that the kind of circuits from our upper bound cannot compute the Parity function. Since Parity is AC0-reducible to Graph Isomorphism, this implies that Graph Isomorphism is strictly harder than Group or Quasigroup Isomorphism under the ordering defined by AC0 reductions. We extend this result to the stronger ACC0[p] reduction and its randomized version.
- Miklos Ajtai. 1983. ∑11-formulae on finite structures. Ann. Pure Appl. Logic 24, 1--48.Google Scholar
Cross Ref
- Vikraman Arvind and Jacobo Toran. 2006. The complexity of quasigroup isomorphism and the minimum generating set problem. In Proceedings of the International Symposium on Algorithms and Computation (ISAAC’06). Tetsuo Asano Ed., Lecture Notes in Computer Science, vol. 4288, Springer, 233--242. Google Scholar
Digital Library
- David Mix Barrington, Peter Kadau, Klaus-Jorn Lange, and Pierre Mckenzie. 2000. On the complexity of some problems on groups input as multiplication tables. In Proceedings of the 15th Annual IEEE Conference on Computational Complexity (CCC’00). 62--69. Google Scholar
Digital Library
- Jin-Yi Cai. 1996. With probability one, a random oracle separates pspace from the polynomial-time hierarchy. J. Comput. Syst. Sci. 38, 1, 68--85. Google Scholar
Digital Library
- Arkadev Chattopadhyay, Jacobo Toran, and Fabian Wagner. 2010. Graph isomorphism is not ac0 reducible to group isomorphism. In Proceedings of the Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’10). K. Lodaya and M. Mahajan Eds., 317--326.Google Scholar
- Josep Diaz and Jacobo Toran. 1990. Classes of bounded nondeterminism. Math. Syst. Theory 23, 1, 21--32.Google Scholar
Cross Ref
- Paul Erdos and Alfred Rényi. 1965. Probabilistic methods in group theory. Journal d’Analyse Mathematique 14, 127--138.Google Scholar
- Merrick L. Furst, James B. Saxe, and Michael Sipser. 1981. Parity, circuits and the polynomial-time hierarchy. In Proceedings of the 22nd Annual Symposium on Foundations of Computer Science (FOCS’81). 260--270. Google Scholar
Digital Library
- Judy Goldsmith, Matthew A. Levy, and Martin Mundhenk. 1996. Limited nondeterminism. SIGACT News 27, 2, 20--29. Google Scholar
Digital Library
- Marshall Hall. 1959. The Theory of Groups. Macmillan, New York.Google Scholar
- Johan Hastad. 1987. Computational Limitations of Small-Depth Circuits. MIT Press. Google Scholar
Digital Library
- Chandra Kintala and Patrick Fisher. 1984. Refining nondeterminism in relativized complexity classes. SIAM J. Comput. 13, 329--337.Google Scholar
- Richard J. Lipton, Lawrence Snyder, and Yechezkel Zalcstein. 1976. The complexity of word and isomorphism problems for finite groups. Tech. rep., John Hopkins.Google Scholar
- Gary L. Miller. 1978. On the nlog n isomorphism technique. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC’78). 51--58. Google Scholar
Digital Library
- Christos H. Papadimitriou and Mihalis Yannakakis. 1996. On limited nondeterminism and the complexity of the vc dimension. J. Comput. Syst. Sci. 53, 161--170. Google Scholar
Digital Library
- Alexander A. Razborov. 1987. Lower bounds on the size of bounded-depth networks over the complete basis with logical addition. Math. Not. Acad. Sci. USSR 41, 4, 333--338.Google Scholar
Cross Ref
- Alexander A. Razborov. 1993. An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic. In Arithmetic, Proof Theory and Computational Complexity, P. Clote and J. Krajicek Eds., Oxford University Press, 247--277.Google Scholar
- Roman Smolensky. 1987. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing (STOC’87). 77--82. Google Scholar
Digital Library
- Jacobo Torán. 2004. On the hardness of graph isomorphism. SIAM J. Comput. 33, 5, 1093--1108. Google Scholar
Digital Library
- Jacobo Torán. 2010. Reductions to graph isomorphism. Theory Comput. Syst. 47, 1, 288--299. Google Scholar
Digital Library
- Fabian Wagner. 2010. On the complexity of isomorphism testing for restricted classes of graphs. Ph.D. thesis. Tech. rep. VTS-ID/7264, Institutional Repository of the University of Ulm.Google Scholar
- Marty J. Wolf. 1994. Nondeterministic circuits, space complexity and quasigroups. Theor. Comput. Sci. 125, 295--313. Google Scholar
Digital Library
- Andrew C. C. Yao. 1985. Separating the polynomial hierarchy by oracles: Part I. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS’85). 1--10. Google Scholar
Digital Library
Index Terms
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
Recommendations
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
The Group Isomorphism problem consists in deciding whether two input groups G1 and G2 given by their multiplication tables are isomorphic. We first give a 2-round Arthur-Merlin protocol for the Group Nonisomorphism problem such that on input groups (G1, ...
Restricted space algorithms for isomorphism on bounded treewidth graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time. We give restricted space algorithms for these problems proving the following results:*Isomorphism for ...
k-Subgraph Isomorphism on AC0 Circuits
Selected papers from the 24th Annual IEEE Conference on Computational Complexity (CCC 2009)Recently, Rossman (STOC ’08) established a lower bound of ω(nk/4) on the size of constant-depth circuits computing the k-clique function on n-vertex graphs for any constant k. This is the first lower bound that does not depend on the depth of circuits ...






Comments