Sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 475-484

  Raz, Ran ^a   Safra, Shmuel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CODING ERRORS; COMBINATORIAL MATHEMATICS; ERROR ANALYSIS; POLYNOMIALS; PROBABILITY;

ERROR PROBABILITY LOW DEGREE TEST; PROBABILISTICALLY CHECKABLE PROOFS (PCP); SET COVER;

COMPUTATIONAL COMPLEXITY;

EID: 0030714232     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)