Abstract
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, G2) of size n, Arthur uses O(log6 n) random bits and Merlin uses O(log2 n) nondeterministic bits. We derandomize this protocol for the case of solvable groups showing the following two results:
(a) We give a uniform NP machine for solvable Group Nonisomorphism, that works correctly on all but 2logO(1)(n) inputs of any length n. Furthermore, this NP machine is always correct when the input groups are nonisomorphic. The NP machine is obtained by an unconditional derandomization of the aforesaid AM protocol.
(b) Under the assumption that EXP \not\subseteq i.o--PSPACE we get a complete derandomization of the aforesaid AM protocol. Thus, EXP \not\subseteq i.o--PSPACE implies that Group Isomorphism for solvable groups is in NP ∩ coNP.
- Agrawal, M., Kayal, N., and Saxena, N. 2004. PRIMES is in P. Ann. Math. 160, 2, 781--793.Google Scholar
Cross Ref
- Arvind, V. and Köbler, J. 1997. On resource bounded measure and pseudorandomness. In Proceedings of the 17th FSTT Conference. Lecture Notes in Computer Science, vol. 1346. Springer, 235--249. Google Scholar
Digital Library
- Arvind, V. and Torán, J. 2004. Solvable group isomorphism is (almost) in NP ∩ coNP. In Proceedings of the 19th Annual IEEE Conference on Computational Complexity. 91--103. Google Scholar
Digital Library
- Balcázar, J. L. 1990. Self-Reducibility. J. Comput. Syst. Sci. 41, 3, 367--388. Google Scholar
Digital Library
- Balcázar, J. L., Díaz, J., and Gabarró, J. 1989. Structural Complexity I. EATCS Monographs on Theoretical Computer Science, Springer.Google Scholar
- Babai, L. 1985. Trading group theory for randomness. In Proceedings of the 17th ACM Symposium on Theory of Computing. 421--429. Google Scholar
Digital Library
- Babai, L., Fortnow, L., Nisan, N., and Wigderson, A. 1993. BPP has subexponential simulations unless EXPTIME has publishable proofs. Comput. Complex. 3, 307--318. Google Scholar
Digital Library
- Babai, L., Goodman, A. J., Kantor, W., Luks, E., and Pálfy, P. P. 1997. Short presentation for finite groups. J. Algebra 194, 79--112.Google Scholar
Cross Ref
- Barrington, D. M., Kadau, P., Lange, K. J., and McKenzie, P. 2001. On the complexity of some problems on groups input as multiplication tables. J. Comput. Syst. Sci. 63, 2, 186--200.Google Scholar
Digital Library
- Erdös, P. and Rényi, A. 1965. Probabilistic methods in group theory. J. Anal. Math. 14, 127--138.Google Scholar
Cross Ref
- Garzon, M. and Zalcstein, Y. 1991. On isomorphism testing of a class of 2-nilpotent groups. J. Comput. Syst. Sci. 42, 2, 237--248. Google Scholar
Digital Library
- Goldreich, O. and Wigderson, A. 2002. Derandomizing that is rarely wrong from short advice that is typically good. In Proceedings of the 6th RANDOM Workshop. Lecture Notes in Computer Science, vol. 2483. Springer, 209--223. Google Scholar
Digital Library
- Hall, M. 1959. The Theory of Groups. Macmillan, New York.Google Scholar
- Klivans, A. and van Melkebeek, D. 2002. Graph isomorphism has subexponential size provers unless the polynomial time hierarchy collapses. SIAM J. Comput. 31, 5, 1501--1526. Google Scholar
Digital Library
- Köbler, J., Schöning, U., and Torán, J. 1992. Graph Isomorphism: Its Structural Complexity. Birkhäuser, Boston.Google Scholar
- Lipton, R. J., Snyder, L., and Zalcstein, Y. 1976. The complexity of word and isomorphism problems for finite groups. Tech. rep., Johns Hopkins University.Google Scholar
- Lu, C.-J. 2001. Derandomizing Arthur-Merlin games under uniform assumptions. J. Comput. Complex. 10, 247--259.Google Scholar
Cross Ref
- Miller, G. L. 1978. On the nlog n isomorphism technique. In Proceedings of the 10th ACM Symposium on the Theory of Computing. 51--58. Google Scholar
Digital Library
- Miltersen, P. B. and Vinodchandran, N. 1999. Derandomizing Arthur-Merlin games using hitting sets. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. 71--80. Google Scholar
Digital Library
- Nisan, N. and Wigderson, A. 1994. Hardness vs randomness. J. Comput. Syst. Sci. 49, 149--167. Google Scholar
Digital Library
- Papadimitriou, C. 1994. Computational Complexity. Addison Wesley.Google Scholar
- Sipser, M. 1983. A complexity theoretic approach to randomness. In Proceedings of the 15th ACM Symposium on the Theory of Computer Science. 330--335. Google Scholar
Digital Library
- Trevisan, L. 2001. Extractors and pseudorandom generators. J. ACM 48, 4, 860--879. Google Scholar
Digital Library
Index Terms
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
Recommendations
Solvable Group Isomorphism is (almost) in NP " CoNP
CCC '04: Proceedings of the 19th IEEE Annual Conference on Computational ComplexityThe Group Isomorphism problem consists in decidingwhether two input groups G_1 and G_2 givenby their multiplication tables are isomorphic. Wefirst give a 2-round Arthur-Merlin protocol for theGroup Non-Isomorphism problem such that on inputgroups (G_1,G_...
Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games
In several settings, derandomization is known to follow from circuit lower bounds that themselves are equivalent to the existence of pseudorandom generators. This leaves open the question whether derandomization implies the circuit lower bounds that are ...
Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games
CCC '12: Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)Hardness against nondeterministic circuits is known to suffice for derandomizing Arthur-Merlin games. We show a result in the other direction - that hardness against nondeterministic circuits is *necessary* for derandomizing Arthur-Merlin games. In fact,...






Comments