scientific article; zbMATH DE number 7765409
From MaRDI portal
Publication:6065460
DOI10.4230/lipics.isaac.2020.51arXiv2006.16191MaRDI QIDQ6065460
Pedro Montealegre, Unnamed Author, Ivan Rapaport
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/abs/2006.16191
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Distributed interactive proofs for the recognition of some geometric intersection graph classes ⋮ Introduction to local certification
Cites Work
- Unnamed Item
- Unnamed Item
- On randomized one-round communication complexity
- Distributed verification of minimum spanning trees
- Randomized proof-labeling schemes
- On distributed Merlin-Arthur decision protocols
- Proof labeling schemes
- Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity
- The Knowledge Complexity of Interactive Proof Systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- What Can be Computed Locally?
- Communication Complexity
- The Power of Distributed Verifiers in Interactive Proofs
- Interactive Distributed Proofs
- Towards a complexity theory for local distributed computing
This page was built for publication:
