ON HELPING AND INTERACTIVE PROOF SYSTEMS

DOI10.1142/S012905419500010XzbMATH Open0830.68111OpenAlexW2080703719MaRDI QIDQ4853334FDOQ4853334

Authors: Vikraman Arvind, Rainer Schuler, Johannes Köbler 

Publication date: 29 October 1995

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905419500010x

Recommendations

• scientific article; zbMATH DE number 1555928
• 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

zbMATH Keywords

sparse setsinteractive proof systemsrobust probabilistic oracle machines

Mathematics Subject Classification ID

Cited In (5)

• The Helping Hierarchy
• Input-oblivious proof systems and a uniform complexity perspective on P/poly
• Title not available (Why is that?)
• Title not available (Why is that?)
• The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

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 Q4853334)