3 search results - page 1 / 1 » Short PCPs with Polylog Query Complexity |
SIAMCOMP
2008
13 years 4 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n
ECCC
2007
13 years 4 months ago
2007
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
ESA
2004
Springer
13 years 9 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...