On Coherence, random-self-reducibility, and self-correction

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1996, Pages 59-67

  Feigenbaum, Joan ^a   Fortnow, Lance ^a   Laplante, Sophie ^a   Naik, Ashish ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EQUIVALENCE CLASSES; FUNCTION EVALUATION; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING; TURING MACHINES;

DETERMINISTIC COHERENCE; NONADAPTIVE EXAMINER; P SAMPLEABLE DISTRIBUTION; RANDOM SELF REDUCIBILITY; REASONABLE COMPLEXITY HYPOTHESIS;

COMPUTATIONAL COMPLEXITY;

EID: 0029720398     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)