The power of distributed verifiers in interactive proofs
From MaRDI portal
Recommendations
Cited in
(39)- Redundancy in distributed proofs
- Compact distributed certification of planar graphs
- Local certification of graphs on surfaces
- A meta-theorem for distributed certification
- Distributed interactive proofs for the recognition of some geometric intersection graph classes
- Interactive proofs for social graphs
- Local certification of graphs with bounded genus
- Succinct non-interactive arguments via linear interactive proofs
- A hierarchy of local decision
- Multi-prover interactive proofs: unsound foundations
- Proof-labeling schemes: broadcast, unicast and in between
- Distributed Provers with Applications to Undeniable Signatures
- Pseudo-deterministic proofs
- Introduction to local certification
- Distributed Testing of Distance-k Colorings
- Interactive distributed proofs
- How proofs are prepared at Camelot (extended abstract)
- scientific article; zbMATH DE number 7765409 (Why is no real title available?)
- A meta-theorem for distributed certification
- Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
- Trade-offs in distributed interactive proofs
- 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
- Locally verifiable distributed SNARGs
- Distributed-prover interactive proofs
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably
- Distributed model checking on graphs of bounded treedepth
- Renaming in distributed certification
- The distributed complexity of locally checkable labeling problems beyond paths and trees
- Tight bounds on the message complexity of distributed tree verification
- On the power of quantum distributed proofs
- Optimal signal processing for common randomness generation over MIMO Gaussian channels with applications in identification
- Shared versus private randomness in distributed interactive proofs
- Distributed quantum proofs for replicated data
- Local certification of geometric graph classes
- Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions
- Reductions in local certification
- Efficient distributed decomposition and routing algorithms in minor-free networks and their applications
This page was built for publication: The power of distributed verifiers in interactive proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146838)
