Bounded Round Interactive Proofs in Finite Groups
- 1 February 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 5 (1) , 88-111
- https://doi.org/10.1137/0405008
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- On the power of interactionCombinatorica, 1990
- 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
- Computing in the Jacobian of a hyperelliptic curveMathematics of Computation, 1987
- Finiteness Theorems for Abelian Varieties over Number FieldsPublished by Springer Nature ,1986
- Arithmetic GeometryPublished by Springer Nature ,1986
- Representation of Group Elements as Short ProductsPublished by Elsevier ,1982
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Probabilistic methods in group theoryJournal d'Analyse Mathématique, 1965