PCP characterizations of NP: Towards a polynomially-small error-probability

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 29-40

  Dinur, Irit ^a   Fischer, Eldar ^a   Kindler, Guy ^a   Raz, Ran ^a   Safra, Shmuel ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; MEMBERSHIP FUNCTIONS; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

POLYNOMIALLY-SMALL ERROR-PROBABILITY; PROBABILISTIC CHECKING OF PROOFS (PCP);

COMPUTATIONAL COMPLEXITY;

EID: 0032662982     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (11)