Randomized proof-labeling schemes
From MaRDI portal
Recommendations
Cites work
Cited in
(20)- Approximate proof-labeling schemes
- Fooling views: a new lower bound technique for distributed computations under congestion
- Error-sensitive proof-labeling schemes
- Approximate proof-labeling schemes
- Redundancy in distributed proofs
- Shared versus private randomness in distributed interactive proofs
- Proof-carrying data from arithmetized random oracles
- Compact distributed certification of planar graphs
- A Randomized Algorithm for BBCSPs in the Prover-Verifier Model
- Connectivity lower bounds in broadcast congested clique
- Proof-labeling schemes: broadcast, unicast and in between
- Proof labeling schemes
- Proof labeling schemes
- Proof-labeling schemes: broadcast, unicast and in between
- Invited Paper: Reactive PLS for Distributed Decision
- Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs
- Randomized proof-labeling schemes
- Twenty-two new approximate proof labeling schemes
- Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs
- Randomized proofs in arithmetic
This page was built for publication: Randomized proof-labeling schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796267)