A characterization of the leaf language classes

Information Processing Letters

Volumn 63, Issue 3, 1997, Pages 153-158

  Borchert, Bernd ^a   Silvestri, Riccardo ^b  

^a Im Neuenheimer Feld 280   (Germany)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Computational complexity; Theory of computation

Indexed keywords

EQUIVALENCE CLASSES; FORMAL LANGUAGES; POLYNOMIALS; SET THEORY;

COMPLEXITY CLASSES; LEAF LANGUAGE CLASSES;

COMPUTATIONAL COMPLEXITY;

EID: 0031212772     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00111-7     Document Type: Article

References (23)

1. L. Adleman, Two theorems on random polynomial time, in: Proc. 19th IEEE Symp. on Foundations of Computer Science (1978) 75-83.
2. K. Ambos-Spies, Sublattices of the polynomial time degrees, Inform, and Control 65 (1985) 63-84.
3. K. Ambos-Spies, Minimal pairs for polynomial time reducibilities, in: Computation Theory and Logic, Lecture Notes in Computer Science, Vol. 270 (Springer, Berlin, 1986) 1-13.
4. K. Ambos-Spies, On the relative complexity of hard problems for complexity classes without complete problems, Theoret. Comput. Sci. 63 (1989) 43-61.
5. J. Balcázar, J. Díaz and J. Gabarró, Structural Complexity I (Springer, Berlin, 1988).
6. B. Borchert, Predicate classes and promise classes, in: Proc. 9th IEEE Structure in Complexity Theory Conf. (1994) 235-241.
7. B. Borchert, Predicate classes, promise classes and the acceptance power of regular languages, Dissertation, Universität Heidelberg, 1994.
8. D.P. Bovet, P. Crescenzi and R. Silvestri, Complexity classes and sparse oracles, in: Proc. 6th IEEE Structure in Complexity Theory Conf. (1991) 102-108; also: J. Comput. System Sci. 50 (1995) 382-390.
9. D.P. Bovet, P. Crescenzi and R. Silvestri, Complexity classes and sparse oracles, in: Proc. 6th IEEE Structure in Complexity Theory Conf. (1991) 102-108; also: J. Comput. System Sci. 50 (1995) 382-390.
10. D.P. Bovet, P. Crescenzi and R. Silvestri, A uniform approach to define complexity classes, Theoret. Comput. Sci. 104 (1992) 263-283.
11. G. Grätzer, Universal Algebra (Springer, New York, 1968).
12. J. Hartmanis and L.A. Hemachandra, Complexity classes without machines: On complete languages for UP, Theoret. Comput. Sci. 58 (1988) 129-142.
13. J. Hartmanis and N. Immerman, On complete problems for NP n co-NP, in: Proc. 12th ICALP, Lecture Notes in Computer Science, Vol. 194 (Springer, Berlin, 1985) 250-259.
14. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer and K. Wagner, On the power of polynomial time bit-reductions, in: Proc. 8th IEEE Structure in Complexity Theory Conf. (1993) 200-207.
15. U. Hertrampf, H. Vollmer and K. Wagner, On balanced vs. unbalanced computation trees, Universität Würzburg, Tech. Rept. No. 82, 1994.
16. B. Jenner, P. McKenzie and D. Thérien, Logspace and logtime leaf languages, in: Proc. 9th IEEE Structure in Complexity Theory Conf. (1994) 242-254.
17. W. Kowalczyk, Some connections between representability of complexity classes and the power of formal systems of reasoning, in: Proc. MFCS, Lecture Notes in Computer Science, Vol. 176 (Springer, Berlin, 1984) 364-369.
18. R. Ladner, On the structure of polynomial-time reducibilities, J. ACM 22 (1975) 155-171.
19. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
20. J. Shinoda and T.A. Slaman, On the theory of the PTIME degrees of the recursive sets, J. Comput. System Sci. 41 (1990) 321-366.
21. R. Silvestri, Complexity classes and relativizations, Dissertation, Università di Roma La Sapienza, 1992.
22. M. Sipser, On relativization and the existence of complete sets, in: Proc. 9th ICALP, Lecture Notes in Computer Science, Vol. 140 (Springer, Berlin, 1982) 523-531.
23. N.K. Vereshchagin, Relativizable and nonrelativizable theorems in the polynomial theory of algorithms, Russian Academy of Sciences, Izvestiya, Math. 42 (1994) 261-298.