A characterization of the leaf language classes
- 14 August 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 63 (3) , 153-158
- https://doi.org/10.1016/s0020-0190(97)00111-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Complexity Classes and Sparse OraclesJournal of Computer and System Sciences, 1995
- RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMSIzvestiya: Mathematics, 1994
- A uniform approach to define complexity classesTheoretical Computer Science, 1992
- On the theory of the PTIME degrees of the recursive setsJournal of Computer and System Sciences, 1990
- On the relative complexity of hard problems for complexity classes without complete problemsTheoretical Computer Science, 1989
- Complexity classes without machines: On complete languages for UPTheoretical Computer Science, 1988
- Sublattices of the polynomial time degreesInformation and Control, 1985
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975