Interactive proof systems with polynomially bounded strategies
From MaRDI portal
Publication:1894457
DOI10.1006/jcss.1995.1040zbMath0837.68107OpenAlexW2180519974MaRDI QIDQ1894457
Anne Condon, Richard E. Ladner
Publication date: 16 April 1996
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/feda3cf82edfeed5b337f90f84747c3d1726e5a0
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Real-time, constant-space, constant-randomness verifiers ⋮ The complexity of debate checking ⋮ How to Verify a Quantum Computation ⋮ Real-time, constant-space, constant-randomness verifiers ⋮ An application of quantum finite automata to interactive proof systems ⋮ Constant-space, constant-randomness verifiers with arbitrarily small error ⋮ PSPACE has constant-round quantum interactive proof systems
This page was built for publication: Interactive proof systems with polynomially bounded strategies
