Local verification of global proofs
From MaRDI portal
Publication:5090917
Recommendations
Cites work
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- scientific article; zbMATH DE number 6820307 (Why is no real title available?)
- Algorithms, games, and the internet
- Approximate proof-labeling schemes
- Communication Complexity
- Distributed verification of minimum spanning trees
- Error-sensitive proof-labeling schemes
- Introduction to algorithms.
- Local Distributed Decision
- Locally checkable proofs in distributed computing
- Non-deterministic graph property testing
- Non-interactive proofs of proximity
- Proof labeling schemes
- Proof labeling schemes
- Proof-labeling schemes: broadcast, unicast and in between
- Survey of distributed decision
- The landscape of communication complexity classes
- Towards a complexity theory for local distributed computing
- Worst-case equilibria
Cited in
(8)- Introduction to local certification
- A hierarchy of local decision
- Locally checkable proofs in distributed computing
- Locally checkable proofs
- Redundancy in distributed proofs
- Compact distributed certification of planar graphs
- Local Proofs for Global Safety Properties
- The hardness of local certification of finite-state dynamics
This page was built for publication: Local verification of global proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090917)