Comparison of weak completeness notions

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1996, Pages 171-178

  Ambos Spies, Klaus ^a   Mayordomo, Elvira ^a   Zheng, Xizhong ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; POLYNOMIALS; SET THEORY; THEOREM PROVING;

EXPONENTIAL TIME SETS; LENGTH-INCREASING ONE-ONE REDUCIBILITY; LUTZ RESOURCE BOUNDED MEASURE THEORY; POLYNOMIAL TIME REDUCIBILITIES; QUERY REDUCTIONS COINCIDE; RESOURCE BOUNDED BAIRE CATEGORY; TRUTH TABLE REDUCIBILITY; WEAK COMPLETENESS NOTIONS;

COMPUTATIONAL COMPLEXITY;

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

References (17)