Diagonalizations over polynomial time computable sets

Theoretical Computer Science

Volumn 51, Issue 1-2, 1987, Pages 177-204

  Ambos Spies, Klaus ^a   Fleischhack, Hans ^a   Huwig, Hagen ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - SET THEORY;

DIAGONALIZATIONS; P-GENERIC SETS; POLYNOMIAL TIME COMPUTABLE SETS;

COMPUTER METATHEORY;

EID: 0023501489     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(87)90053-3     Document Type: Article

References (20)

1. p-Mitotic sets
2. Polynomial time degrees of NP-sets
3. p-Generic sets
4. Relativizations of the P=? NP question
5. Separating, strongly separating and collapsing relativized complexity classes
6. A with probability 1
7. A note on structure and looking back applied to the relative complexity of computable functions
8. On diagonalizations over complexity classes
9. p-Genericity and strong p-genericity
10. Oracle-dependent properties of the lattice of NP-sets
11. Genericity for recursively enumerable sets
12. Indexing of subrecursive classes
13. On the structure of polynomial time reducibility
14. A comparison of polynomial time reducibilities
15. On the structure of sets in NP and other complexity classes
16. Recursively enumerable generic sets
17. A uniform approach to obtain diagonal sets in complexity classes
18. p-Selective sets, tally languages, and the behaviour of polynomial time reducibilities on NP