Randomized proofs in arithmetic
From MaRDI portal
Recommendations
- Randomized algorithms in number theory
- Randomness in interactive proofs
- Randomness, pseudorandomness and models of arithmetic
- The computational content of arithmetical proofs
- Randomness below complete theories of arithmetic
- Proofs of Randomized Algorithms in Coq
- Proofs of randomized algorithms in Coq
- Randomized proof-labeling schemes
- Randomized proof-labeling schemes
Cites work
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Algebraic methods for interactive proof systems
- Alternation
- Arithmetization: A new method in structural complexity theory
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Classifying the computational complexity of problems
- IP = PSPACE
- The Knowledge Complexity of Interactive Proof Systems
Cited in
(8)- A note on monte carlo primality tests and algorithmic information theory
- Randomization, persuasiveness and rigor in proofs
- Probabilistic verification of proofs in calculuses
- Proof-carrying data from arithmetized random oracles
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Proofs of randomized algorithms in Coq
- Random arithmetic formulas can be reconstructed efficiently
- Proofs of Randomized Algorithms in Coq
This page was built for publication: Randomized proofs in arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807460)
