Addendum to: Non-deterministic exponential time has two-prower interactive protocols

DOI10.1007/BF01200430zbMath0796.68096OpenAlexW2097206148MaRDI QIDQ1210334

Carstent Lund, László Babai, Lance J. Fortnow

Publication date: 15 August 1993

Published in: Computational Complexity (Search for Journal in Brave)

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

zbMATH Keywords

interactive proof systemsprogram verificationverification scheme for multilinearitytwo-prover interactive protocols

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Multi-oracle interactive protocols with constant space verifiers, Bounding queries in the analytic polynomial-time hierarchy, Spartan: efficient and general-purpose zkSNARKs without trusted setup, A note on enumerative counting