Trade-offs in distributed interactive proofs
From MaRDI portal
Recommendations
Cited in
(21)- Redundancy in distributed proofs
- Compact distributed certification of planar graphs
- Distributed interactive proofs for the recognition of some geometric intersection graph classes
- Local certification of graphs with bounded genus
- A hierarchy of local decision
- Proof-labeling schemes: broadcast, unicast and in between
- Distributed Provers with Applications to Undeniable Signatures
- Introduction to local certification
- The power of distributed verifiers in interactive proofs
- Interactive distributed proofs
- scientific article; zbMATH DE number 7765409 (Why is no real title available?)
- Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs
- Twenty-two new approximate proof labeling schemes
- The hardness of local certification of finite-state dynamics
- Distributed model checking on graphs of bounded treedepth
- Renaming in distributed certification
- Shared versus private randomness in distributed interactive proofs
- Distributed quantum proofs for replicated data
- Local certification of geometric graph classes
- Shared randomness helps with local distributed problems
- Distributed complexity of P_k-freeness: decision and certification
This page was built for publication: Trade-offs in distributed interactive proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487530)
