Alternation in interaction

DOI10.1007/PL00001607MaRDI QIDQ5946704zbMATH OpenOpenAlexFDO

Authors Marcos Kiwi, C. Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram

Publication date 2 June 2002

Published in Computational Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00001607

zbMATH Keywords

cooperating proversinteractive proof systems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Noncooperative games (91A10)

Recommendations

• On the power of multi-prover interactive protocols
• scientific article; zbMATH DE number 512981
• scientific article; zbMATH DE number 176510
• Interactive proof systems with polynomially bounded strategies
• scientific article; zbMATH DE number 4106274

Cited in

(11)

• Multi-oracle interactive protocols with constant space verifiers
• On the power of multi-prover interactive protocols
• A note on PCP vs. MIP
• Interactive proof systems with polynomially bounded strategies
• scientific article; zbMATH DE number 4106274 (Why is no real title available?)
• scientific article; zbMATH DE number 18527 (Why is no real title available?)
• scientific article; zbMATH DE number 512981 (Why is no real title available?)
• The complexity of debate checking
• Interactive proofs with competing teams of no-signaling provers
• Oblivious Symmetric Alternation
• Non-deterministic exponential time has two-prover interactive protocols

This page was built for publication: Alternation in interaction

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