IP = SPACE

DOI10.1145/146585.146613MaRDI QIDQ4302794zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 13 November 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/146585.146613

zbMATH Keywords

interactive proofsPSPACE

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• IP = PSPACE
• scientific article; zbMATH DE number 4768
• \(\mathrm{QIP} = \mathrm{PSPACE}\)
• QIP = PSPACE
• scientific article; zbMATH DE number 1107488
• Publication:4508503
• An implicit characterization of PSPACE
• P-spaces and the Whyburn property
• scientific article; zbMATH DE number 4092127
• scientific article; zbMATH DE number 1556632

Cited in

(16)

• Geometric sets of low information content
• Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
• PSPACE has constant-round quantum interactive proof systems
• Probabilistic verification of proofs in calculuses
• IP = PSPACE using error-correcting codes
• \(\mathrm{QIP} = \mathrm{PSPACE}\)
• IP = PSPACE
• Generalized quantum Arthur-Merlin games
• scientific article; zbMATH DE number 4768 (Why is no real title available?)
• Shorter arithmetization of nondeterministic computations
• Nonlocal Games with Noisy Maximally Entangled States are Decidable
• Relativization and interactive proof systems in parameterized complexity theory
• A combination of testability and decodability by tensor products
• QIP = PSPACE
• Structural complexity of rational interactive proofs
• Logspace verifiers, NC, and NP

This page was built for publication: IP = SPACE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302794)