On the Complexity of Some Problems on Groups Input as Multiplication Tables

Journal of Computer and System Sciences

Volumn 63, Issue 2, 2001, Pages 186-200

  Barrington, David Mix ^a   Kadau, Peter ^b   Lange, Klaus Jörn ^b   McKenzie, Pierre ^c  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b UNIVERSITY OF TÜBINGEN   (Germany)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041078936     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1764     Document Type: Article

References (35)

1. Allender E., Barrington D. A. M., Hesse W. Uniform circuits for division: Consequences and problems. Proc. 16th IEEE Conference on Computational Complexity. 2001;. p. 150-159.
2. Hesse W., Allender E., Barrington D. A. M. Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. System Sci. 2001.
3. Babai L. Trading group theory for randomness. Proc. 17th ACM STOC. 1985;. p. 421-429.
4. Babai L., Szemerédi E. On the complexity of matrix group problems I. Proc. 25th IEEE FOCS. 1984;. p. 229-240.
5. 1. J. Comput. System Sci. 38:1989;150-164.
6. Barrington D. A. M., Immerman N. Time, hardware, and uniformity. Hemaspaandra L. A., Selman A. L. Complexity Theory Retrospective II. 1997;1-22 Springer-Verlag, New York.
7. Barrington D. A. M., Kadau P., Lange K.-J., McKenzie P. On the complexity of some problems on groups input as multiplication tables. Proc. 15th IEEE Conference on Computational Complexity. 2000;. p. 62-69.
8. Barrington D. A. M., McKenzie P. Oracle branching programs and Logspace versus P. Inform. and Comput. 95:1991;96-115.
9. 1. J. Comput. System Sci. 41:1990;274-306.
10. Babai L., Luks E., Seress A. Permutation Groups in NC. Proc. 19th ACM STOC. 1987;. p. 409-420.
11. Beame P., Cook S., Hoover J. Log depth circuits for division and related problems. SIAM J. Comput. 15:1986;994-1003.
12. Beame P., Impagliazzo R., Pitassi T. Improved lower bounds for small distance connectivity. Comput. Complexity. 7:1998;325-345.
13. Borodin A. On relating time and space to size and depth. SIAM J. Comput. 6:1977;733-744.
14. Chandra A. K., Stockmeyer L., Vishkin U. Constant depth reducibility. SIAM J. Comput. 13:1984;423-439.
15. 1 division, Preliminary version. Also available at, http://www.cs.jcu.edu.au as bruce/papers/crr00.ps.gz .
16. Cook S. A. A taxonomy of problems with fast parallel algorithms. Inform. and Control. 64:1985;2-22.
17. Cook S. A., McKenzie P. Problems complete for deterministic logarithmic space. J. Algorithms. 8:1987;385-394.
18. Furst M., Hopgoft J., Luks E. Polynomial time algorithms for permutation groups. Proc. 21st IEEE FOCS. 1980;. p. 36-41.
19. Furst M., Saxe J., Sipser M. Parity, circuits, and the polynomial-time hierarchy. Math. Systems Theory. 17:1984;13-27.
20. Håstad J. Computational Limitations of Small Depth Circuits. 1988;MIT Press, Cambridge.
21. 0. Proc. 28th ICALP. LNCS #2076. 2001;. p. 104-114.
22. Hoffmann C. Group-Theoretic Algorithms and Graph Isomorphism. Lecture Notes in Computer Science. 136:1979;Springer-Verlag, Berlin/New York.
23. Immerman N. Descriptive and computational complexity. Harmanis J. Computational Complexity Theory. Proc. of Symposia in Applied Mathematics. 38:1989;75-91 Amer. Math. Soc. Providence.
24. Immerman N. Descriptive Complexity. 1999;Springer-Verlag, New York.
25. Jones N. D., Laaser W. T. Complete problems for deterministic polynomial time. Theoret. Comput. Sci. 3:1977;105-117.
26. Jones N. D., Lien E., Laaser W. T. New problems complete for nondeterministic log space. Math. Systems Theory. 10:1976;1-17.
27. Lipton R. J., Snyder L., Zalcstein Y. The complexity of word and isomorphism problems for finite groups. Proceedings of the Johns Hopkins University Conference on Information Sciences and Systems. 1976;. p. 33-35.
28. Luks E. M., McKenzie P. Parallel algorithms for solvable permutation groups. J. Comput. Systems Sci. 37:1988;39-62.
29. McKenzie P., Cook S. A. The parallel complexity of the abelian permutation group membership problem. Proc. 24th IEEE FOCS. 1983;. p. 154-161.
30. Rotman J. The theory of Groups. 1973;Allyn & Bacon, Boston.
31. Sims C. C. Computational methods in the study of permutation groups. Leech J. Computational Problems in Abstract Algebra. 1970;169-183 Pergamon Press, New York.
32. Sipser M. Borel sets and circuit complexity. Proc. 15th ACM STOC. 1983;. p. 61-69.
33. Smolensky R. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. Proc. 19th ACM STOC. 1987;. p. 77-82.
34. Thérien D. Research Report. CS-80-19:1980.
35. Yao A. C. Separating the polynomial-time hierarchy by oracles. Proc. 26th IEEE FOCS. 1985;. p. 1-10.