Sublattices of the polynomial time degrees
Open Access
- 30 April 1985
- journal article
- Published by Elsevier in Information and Control
- Vol. 65 (1) , 63-84
- https://doi.org/10.1016/s0019-9958(85)80020-6
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An Inhomogeneity in the Structure of Karp DegreesSIAM Journal on Computing, 1986
- A note on deterministic and nondeterministic time complexityInformation and Control, 1982
- A note on a theorem by LadnerInformation Processing Letters, 1982
- A uniform approach to obtain diagonal sets in complexity classesTheoretical Computer Science, 1982
- On the structure of sets in NP and other complexity classesTheoretical Computer Science, 1981
- A note on structure and looking back applied to the relative complexity of computable functionsJournal of Computer and System Sciences, 1981
- On splitting recursive setsJournal of Computer and System Sciences, 1978
- Polynomial and abstract subrecursive classesJournal of Computer and System Sciences, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975