338 search results - page 1 / 68 » Locally checkable proofs |
PODC
2011
ACM
12 years 10 months ago
2011
ACM
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...
LPAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
ISTCS
1995
Springer
13 years 10 months ago
1995
Springer
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
RSA
2006
13 years 7 months ago
2006
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
MKM
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we address the problem of reconstructing a higher order, checkable proof object starting from a proof trace left by a first order automatic proof searching procedure...