

Title: 
Locally checkable proofs in distributed computing 
Author(s): 
Göös, Mika
;
Suomela, Jukka

Date: 
2016 
Language: 
en 
Department: 
Harvard University Department of Computer Science 
Series: 
THEORY OF COMPUTING, Volume 12 
DOInumber: 
10.4086/toc.2016.v012a019

Subject: 
113 Computer and information sciences

Keywords: 
Distributed computing, Graphs, Locality, Nondeterminism, 113 Computer and information sciences

» Show full item record


Citation:
Göös , M & Suomela , J 2016 , ' Locally checkable proofs in distributed computing ' , THEORY OF COMPUTING , vol. 12 , 19 , pp. 1–33 . https://doi.org/10.4086/toc.2016.v012a019

Abstract:
We study decision problems related to graph properties from the perspective of nondeterministic distributed algorithms. For a yesinstance there must exist a proof that can be verified with a distributed algorithm: all nodes must accept a valid proof, and at least one node must reject an invalid proof. We focus on locally checkable proofs that can be verified with a constanttime distributed algorithm. For example, it is easy to prove that a graph is bipartite: the locally checkable proof gives a 2coloring of the graph, which only takes 1 bit per node. However, it is more difficult to prove that a graph is not bipartite—it turns out that any locally checkable proof requires Ω(logn) bits per node. In this paper we classify graph properties according to their local proof complexity, i. e., how many bits per node are needed in a locally checkable proof. We establish tight or neartight results for classical graph properties such as the chromatic number. We show that the local proof complexities form a natural hierarchy of complexity classes: for many classical graph properties, the local proof complexity is either 0, Θ(1), Θ(logn), or poly(n) bits per node. Among the most difficult graph properties are proving that a graph is symmetric (has a nontrivial automorphism), which requires Ω(n2) bits per node, and proving that a graph is not 3colorable, which requires Ω(n2=logn) bits per node. Any property of connected graphs admits a trivial proof with O(n2) bits per node.


Permanent link to this item:
http://urn.fi/URN:NBN:fi:aalto201612165961
