Improved lowness results for solvable black-box group problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1346, Issue , 1997, Pages 220-234

  Vinodchandran, N V ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ELECTRIC COMMUTATORS; SOFTWARE ENGINEERING;

BLACK-BOX GROUPS; COMPUTATIONAL PROBLEM; COUNTING CLASS; COUNTING COMPLEXITY; FUNDAMENTAL STRUCTURES; GAP-DEFINABLE COUNTING CLASS; POLYNOMIAL HIERARCHIES; RANDOMIZED ALGORITHMS;

GROUP THEORY;

EID: 0012524651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0058033     Document Type: Conference Paper

References (16)

1. V. Arvind and N. V. Vinodchandran. Solvable Black-Box Group Problems are low for PP. Symposium on Theoretical Aspects of Computer Science, LNCS Voi: 1046, 99-110, 1996.
2. L. Babai. Bounded round interactive proofs in finite groups. SIAM Journal of Discrete Mathematics, 5: 88-111, 1992.
3. L. Babai, G. Cooperman, L. Finkeistein, E. Luks and Á. Seress. Fast Monte Carlo algorithms for permutation groups. In Journal of Computer and System Sciences, 50: 296-308, 1995.
4. L. Babai and M. Szemerédi. On the complexity of matrix group problems I. Proc. 25th IEEE Symposium on Foundations of Computer Science, 229-240, 1984.
5. J. L. Balcázar, J. Díaz and J. Gabarró. Structural Complexity - I & II. Springer Verlag, Berlin Hiedelberg, 1988.
6. R. Boppana, J. Hastad and S. Zachos. Does co-NP have short interactive proofs? Information Processing Letters, 25: 127-132, 1987.
7. W. Burnside. Theory of Groups of Finite Order, Dover Publications, INC, 1955.
8. G. Cooperman and L. Finkelstein. Random algorithms for permutation groups. CWI Quarterly, 5 (2): 93-105, 1992.
9. S. Fenner, L. Fortnow and S. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48: 116-148, 1994.
10. M. Fellows and N. Koblitz. Self-witnessing polynomial time complexity and prime factorization. Proc. 6th Structure in Complexity Theory Conference, 107-110, 1992.
11. M. Fürst, J. E. Hopcroft and E. Luks. Polynomial time algorithms for permutation groups. Proc. 21st IEEE Symposium of Foundations of Computer Science, 36-45, 1980.
12. M. Hall. The Theory of Groups. Macmillan, New York, 1959.
13. C. Hoffmann. Group-Theoretic Algorithms and Graph Isomorphism. Lecture Notes in Computer Science #136, Springer Verlag, 1982.
14. C. Hoffmann. Subcomplete Generalizations of Graph Isomorphism. Journal of Computer and System Sciences, 25: 332-359, 1982.
15. J. Köbler, U. Schöning and J. Torán. Graph isomorphism is low for PP. Journal of Computational Complexity, 2: 301-310, 1992.
16. U. Schöning. Graph isomorphism is in the low hierarchy. Journal of Computer and System Sciences, 37: 312-323, 1988.