Probabilistic verification of proofs in calculuses

DOI10.1007/BF02362268zbMath0958.68070MaRDI QIDQ1977920

Evgeny Dantsin

Publication date: 6 June 2000

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

probabilistically checkable proof system

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Non-deterministic exponential time has two-prover interactive protocols
• Randomized proofs in arithmetic
• Algebraic methods for interactive proof systems
• IP = PSPACE
• IP = SPACE
• Contributions to the Theory of Optimal Control. A General Procedure for the Computation of Switching Manifolds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic verification of proofs in calculuses