On the structure of polynomial time degrees
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 198-208
- https://doi.org/10.1007/3-540-12920-0_18
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the complement of one complexity class in anotherPublished by Springer Nature ,1984
- A note on a theorem by LadnerInformation Processing Letters, 1982
- On the structure of sets in NP and other complexity classesTheoretical Computer Science, 1981
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971