Rational Proofs with Multiple Provers

DOI10.1145/2840728.2840744zbMath1334.68080arXiv1504.08361OpenAlexW765055999MaRDI QIDQ2800569

Shikha Singh, Jing Chen, Samuel McCauley

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.08361

zbMATH Keywords

interactive proofscomplexity theoryscoring rulesdc uniform circuit familiesmulti-prover rational interactive proofs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Structural complexity of rational interactive proofs ⋮ Verifiable crowd computing: coping with bounded rationality ⋮ Unnamed Item ⋮ Sumcheck-based delegation of quantum computing to rational server

This page was built for publication: Rational Proofs with Multiple Provers