scientific article
From MaRDI portal
Publication:4011253
zbMATH Open0751.03020MaRDI QIDQ4011253
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
randomnessPSPACEzero-knowledgeproververifierinteractive proof-systemcomplexity class IPinteractive proofs of membership
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items (8)
Title not available (Why is that?) ⋮ A logic of interactive proofs ⋮ Multi-prover interactive proofs: unsound foundations ⋮ Succinct interactive oracle proofs: applications and limitations ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings ⋮ Automata, Languages and Programming ⋮ Interactive Termination Proofs Using Termination Cores ⋮ Interactive Coding for Interactive Proofs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4011253)
