338 search results - page 27 / 68 » Locally checkable proofs |
FOSSACS
2008
Springer
15 years 1 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
101
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
187
click to vote
POPL
2006
ACM
16 years 3 days ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
STOC
2009
ACM
16 years 12 days ago
2009
ACM
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-onsolid model of statistical physics. This model has been proposed...
110
click to vote
CSFW
2005
IEEE
15 years 5 months ago
2005
IEEE
Authentication and secrecy properties are proved by very different methods: the former by local reasoning, leading to matching knowledge of all principals about the order of their...