scientific article; zbMATH DE number 176510

zbMATH Open0764.68067MaRDI QIDQ4035675FDOQ4035675

Authors: Lance Fortnow, C. Lund 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Interactive proof systems and alternating time-space complexity
• scientific article; zbMATH DE number 512803
• scientific article; zbMATH DE number 176552
• The Knowledge Complexity of Interactive Proof Systems
• The knowledge complexity of interactive proof-systems
• Interactive proof systems with polynomially bounded strategies
• Time-optimal interactive proofs for circuit evaluation
• Relativization and interactive proof systems in parameterized complexity theory
• Interactive proofs with approximately commuting provers
• scientific article; zbMATH DE number 512981

zbMATH Keywords

alternating time-space complexitypublic-coin interactive proof system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cited In (7)

• Constant-Round Interactive Proof Systems for AC0[2] and NC1
• Interactive proof systems with public coin: lower space bounds and hierarchies of complexity classes
• On the complexity of interactive proofs with bounded communication
• Interactive proof systems and alternating time-space complexity
• Logspace verifiers, NC, and NP
• Constant-round arguments from one-way functions
• Alternation in interaction

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