Distributed interactive proofs admit a continuous space-communication trade-off for triangle-freeness, broad communication savings from shared randomness, and a separation between interaction-reduction and linear-size proof-labeling schemes.
9 Andrew Drucker, Fabian Kuhn, and Rotem Oshman
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Trade-offs in Distributed Interactive Proofs
Distributed interactive proofs admit a continuous space-communication trade-off for triangle-freeness, broad communication savings from shared randomness, and a separation between interaction-reduction and linear-size proof-labeling schemes.