Sciweavers

106
Voted
PODC
2011
ACM
13 years 11 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela