Solvable group isomorphism is (almost) in NP ∩ coNP

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 91-103

  Arvind, V ^a   Torán, Jacobo ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; INTEGER PROGRAMMING; NETWORK PROTOCOLS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

CAYLEY TABLES; GROUP ISOMORPHISM; ISOMORPHIC GROUPS; MULTIPLICATION TABLES;

COMPUTATIONAL COMPLEXITY;

EID: 4944266285     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. M. AGRAWAL, N. KAYAL AND N. SAXENA, PRIMES is in P. Preprint, August 4, 2002, http://ww.cse.iitk.ac.in/users/manindra/.
2. V. ARVIND AND J. KÖBLER, On resource bounded measure and pseudorandomness, Proc. 17th FSTT Conference Lecture Notes in Computer Science 1346 Springer Verlag, 235-249, (1997).
3. J. L. BALCÁZAR, Self-Reducibility, Journal of Computer and System Sciences 41-3, 367-388, (1990).
4. J. L. BALCÁZAR, J. DÍAZ, J. GABARRÓ, Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1989.
5. L. BABAI, Trading group theory for randomness, Proc. 17th ACM Symposium on Theory of Computing, 421-429, 1985.
6. L. BABAI, L. FORTNOW, N. NISAN, AND A. WIGDERSON, BPP has subexponential simulations unless EXPTIME has publishable proofs, Computational Complexity, 3, pp. 307-318, 1993.
7. L. BABAI, A.J. GOODMAN, W. KANTOR, E. LUKS, P.P. PÁLFY, Short presentation for finite groups, in Journal of Algebra, 194, 79-112, 1997.
8. D.M. BARRINGTON, P. KADAU, K.J. LANGE AND P. MCKENZIE On the Complexity of Some Problems on Groups Input as Multiplication Tables, in J. Comput Syst. Sci. 63(2) 2001, 186-200.
9. P. ERDÖS, A. RÉNYI, Probabilistic Methods in group theory, Jour. Analyse Mathématique, vol. 14, (1965), 127-138.
10. O. GOLDREICH, A. WIGDERSON, Derandomizmg that is rarely wrong from short advice that is typically good, in Proc. 6th RANDOM workshop Lecture Notes in Computer Science 2483, 2002, 209-223.
11. GARZON AND ZALCSTEIN, On Isomorphism Testing of a Class of 2-Nilpotent Groups, in Journal of Computer and System Sciences, voL 42(2), 237-248, 1991.
12. M. HALL, The Theory of Groups, Macmillan, NewYork, 1959.
13. A. KLIVANS AND D. VAN MELKEBEEK, Graph Isomorphism has subexponential size provers unless the polynomial time hierarchy collapses. SIAM Journal of Computing, 31(5): 1501-1526 (2002).
14. R.J. LIPTON, L. SNYDER, Y. ZALCSTEIN The complexity of word and isomorphism problems for finite groups. Johns Hopkins University 1976.
15. C.-J. LU, Derandomizing Arthur-Merlin games under uniform assumptions, in Journal of Computational Complexity, 10 2001, 247-259.
16. logn isomorphism technique, in. Proc. 10th ACM Symposium on the Theory of Computing, 1978, 51-58.
17. N. NISAN AND A. WIGDERSON, Hardness vs randomness, in Journal of Computer and System Sciences, 49:149-167, 1994.
18. P.B. MILTERSEN, N. VINODCHANDRAN, Derandomizing Arthur-Merlin games using hitting sets, in Proc. 40th IEEE Symposium on Foundations of Computer Science, 1999, 71-80.
19. C. PAPADIMITRIOU, Computational Complexity, Addison Wesley, 1994.
20. M. SIPSER,A complexity theoretic approach to randomness. In Proc. 15th ACM Symp. Theory of Computer Science 1983, 330-335.