scientific article
From MaRDI portal
Publication:3792245
zbMath0647.68052MaRDI QIDQ3792245
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
probabilistic complexity classesinteractive proof systemsalternating quantifiersArthur-Merlin gamesprobabilistic quantifier
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Stathis Zachos at 70! ⋮ Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes ⋮ Does co-NP have short interactive proofs ? ⋮ Probabilistic quantifiers and games ⋮ Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete ⋮ Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy ⋮ On pseudorandomness and resource-bounded measure ⋮ Quantum 3-SAT Is QMA$_1$-Complete ⋮ Probabilistic complexity classes and lowness ⋮ Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More) ⋮ Generalized lowness and highness and probabilistic complexity classes ⋮ A note on the non-NP-hardness of approximate lattice problems under general Cook reductions.
This page was built for publication:
