On helping and interactive proof systems

DOI10.1007/3-540-58325-4_175MaRDI QIDQ4525694zbMATH OpenFDO

Authors Vikraman Arvind, Rainer Schuler, Johannes Köbler

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58325-4_175

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• ON HELPING AND INTERACTIVE PROOF SYSTEMS
• On the power of multi-prover interactive protocols
• scientific article; zbMATH DE number 4106274
• On interactive proofs with a laconic prover
• scientific article; zbMATH DE number 512981

Cited in

(8)

• On helping by robust oracle machines
• New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes.
• Interactive Coding for Interactive Proofs
• scientific article; zbMATH DE number 3874584 (Why is no real title available?)
• The Helping Hierarchy
• On interactive proofs with a laconic prover (extended abstract)
• Identifying an honest \(\mathrm{EXP}^{\mathrm{NP}}\) oracle among many
• ON HELPING AND INTERACTIVE PROOF SYSTEMS

This page was built for publication: On helping and interactive proof systems

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