ON HIGHER ARTHUR-MERLIN CLASSES
From MaRDI portal
Publication:5696962
Recommendations
Cites work
- A complexity theory for feasible closure properties
- A decisive characterization of BPP
- Algebraic methods for interactive proof systems
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Complexity classes of optimization functions
- Does co-NP have short interactive proofs ?
- Graph isomorphism is in the low hierarchy
- scientific article; zbMATH DE number 1379310 (Why is no real title available?)
- IP = PSPACE
- Non-deterministic exponential time has two-prover interactive protocols
- On pseudorandomness and resource-bounded measure
- On the limits of nonapproximability of lattice problems
- PP is as Hard as the Polynomial-Time Hierarchy
- Probabilistic complexity classes and lowness
- Relativized circuit complexity
- Symmetric alternation captures BPP
- THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
- The Formula Isomorphism Problem
- The operators min and max on the polynomial hierarchy
Cited in
(4)
This page was built for publication: ON HIGHER ARTHUR-MERLIN CLASSES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696962)