How Proofs are Prepared at Camelot

DOI10.1145/2933057.2933101zbMath1375.68190OpenAlexW2273528466MaRDI QIDQ5361961

Petteri Kaski, Andreas Björklund

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933057.2933101

zbMATH Keywords

Reed-Solomonbatch evaluationnoninteractive proofparameterized cliquevector parallel

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)

Related Items (6)

A short note on Merlin-Arthur protocols for subset sum ⋮ Proofs of Work from worst-case assumptions ⋮ Unnamed Item ⋮ Improved Merlin-Arthur protocols for central problems in fine-grained complexity ⋮ Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants ⋮ Unnamed Item

This page was built for publication: How Proofs are Prepared at Camelot