Probabilistically checkable proofs with low amortized query complexity

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1998, Pages 18-27

  Sudan, Madhu ^a   Trevisan, Luca ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ERROR ANALYSIS; NETWORK PROTOCOLS; PROBABILITY; QUERY LANGUAGES; THEOREM PROVING;

AMORTIZED QUERY COMPLEXITY; BOOLEAN CONSTRAINT SATISFACTION PROBLEM; PROBABILISTIC CHECKABLE PROOFS (PCP);

COMPUTER SCIENCE;

EID: 0032313603     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)