Solvable black-box group problems are low for PP
- 10 June 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 180 (1-2) , 17-45
- https://doi.org/10.1016/s0304-3975(96)00100-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast Monte Carlo Algorithms for Permutation GroupsJournal of Computer and System Sciences, 1995
- Combinatorial tools for computational group theoryPublished by American Mathematical Society (AMS) ,1993
- Graph isomorphism is low for PPcomputational complexity, 1992
- Bounded Round Interactive Proofs in Finite GroupsSIAM Journal on Discrete Mathematics, 1992
- Graph isomorphism is in the low hierarchyJournal of Computer and System Sciences, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987