Sciweavers

3 search results - page 1 / 1
» Short PCPs with Polylog Query Complexity
Sort
View
SIAMCOMP
2008
130views more  SIAMCOMP 2008»
13 years 10 months ago
Short PCPs with Polylog Query Complexity
We give constructions of probabilistically checkable proofs (PCPs) of length n
Eli Ben-Sasson, Madhu Sudan
ECCC
2007
86views more  ECCC 2007»
13 years 10 months ago
Interactive PCP
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...
Yael Tauman Kalai, Ran Raz
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
14 years 4 months ago
Fast 3-Coloring Triangle-Free Planar Graphs
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 ...
Lukasz Kowalik