Probabilistic verification of proofs in calculuses
From MaRDI portal
Recommendations
Cites work
- Algebraic methods for interactive proof systems
- Contributions to the Theory of Optimal Control. A General Procedure for the Computation of Switching Manifolds
- scientific article; zbMATH DE number 1256635 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 727431 (Why is no real title available?)
- scientific article; zbMATH DE number 1072531 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- IP = PSPACE
- IP = SPACE
- Non-deterministic exponential time has two-prover interactive protocols
- Randomized proofs in arithmetic
Cited in
(7)- Towards a structural proof theory of probabilistic \(\mu\)-calculi
- Probabilistic verification and approximation
- VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
- scientific article; zbMATH DE number 1500556 (Why is no real title available?)
- scientific article; zbMATH DE number 2086517 (Why is no real title available?)
- On the concrete efficiency of probabilistically-checkable proofs
- Probabilistic verification of Boolean functions
This page was built for publication: Probabilistic verification of proofs in calculuses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977920)