IP = SPACE
From MaRDI portal
Publication:4302794
DOI10.1145/146585.146613zbMath0799.68098OpenAlexW2032626654WikidataQ57349918 ScholiaQ57349918MaRDI QIDQ4302794
No author found.
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Geometric sets of low information content ⋮ Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ Structural complexity of rational interactive proofs ⋮ Generalized Quantum Arthur--Merlin Games ⋮ Probabilistic verification of proofs in calculuses ⋮ Shorter arithmetization of nondeterministic computations ⋮ Unnamed Item ⋮ A combination of testability and decodability by tensor products ⋮ Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity ⋮ PSPACE has constant-round quantum interactive proof systems
