Sciweavers

STOC
1999
ACM
104views Algorithms» more  STOC 1999»
14 years 3 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld