Uniform characterizations of complexity classes of functions

International Journal of Foundations of Computer Science

Volumn 11, Issue 4, 2000, Pages 525-551

  Kosub, Sven ^a   Schmitz, Heinz ^a   Vollmer, Heribert ^a   Cai, Jin ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Computational complexity; function classes; leaf languages; machine models; relativizations

Indexed keywords

EID: 0038477158     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054100000326     Document Type: Article

References (40)

1. E. Allender. Oracles versus proof techniques that do not relativize. In Proceedings 1st International Symposium on Algorithms, volume 450 of Lecture Notes in Computer Science, pages 39-52. Springer Verlag, 1990.
2. J. L. Balcazar, J. Diaz, and J. Gabarro. Structural Complexity I. Texts in Theoretical Computer Science. Springer Verlag, Berlin, 2nd edition, 1995.
3. R. V. Book, T. J. Long, and A. L. Selman. Quantitative relativizations of complexity classes. SIAM Journal on Computing, 13:461-487, 1984.
4. B. Borchert. Predicate classes, promise classes, and the acceptance power of regular languages. PhD thesis, Naturwissenschaftlich-Mathematische Fakultat, Universitat Heidelberg, 1994.
5. B. Borchert. On the acceptance power of regular languages. Theoretical Computer Science, 148:207-225, 1995.
6. B. Borchert and A. Lozano. Succinct circuit representations and leaf language classes are basically the same concept. Information Processing Letters, 58:211-215, 1996.
7. B. Borchert and R. Silvestri. The general notion of a dot operator. In Proceedings 12th Conference on Computational Complexity, pages 26-44. IEEE Computer Society Press, 1997. To appear in Theoretical Computer Science.
8. D. P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. International Series in Computer Science. Prentice Hall, London, 1994.
9. D. P. Bovet, P. Crescenzi, and R. Silvestri. A uniform approach to define complexity classes. Theoretical Computer Science, 104:263-283, 1992.
10. S. A. Fenner, L. Fortnow, and S. A. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48:116-148, 1994.
11. L. Fortnow. The role of relativization in complexity theory. Bulletin of the EATCS, 52:229-244, 1994.
12. C. Glafier and G. Wechsung. Relativizing function classes. Technical Report 219, Institut fiir Informatik, Universitat Wurzburg, 1999.
13. L. A. Hemaspaandra and H. Vollmer. The satanic notations: counting classes beyond # P and other definitional adventures. Complexity Theory Column 8, ACMSIGACT Newsletter, 26(1):2-13, 1995.
14. H. Hempel and G. Wechsung. The operators min and max on the polynomial hierarchy. International Journal of Foundations of Computer Science, 11(2):315-342, 2000.
15. U. Hertrampf. Classes of bounded counting type and their inclusion relations. In Proceedings 12th Symposium on Theoretical Aspects of Computer Science, volume 900 of Lecture Notes in Computer Science, pages 60-70. Springer Verlag, 1995.
16. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, and K. W. Wagner. On the power of polynomial time bit-reductions. In Proceedings 8th Structure in Complexity Theory, pages 200-207, IEEE Computer Society Press, 1993.
17. U. Hertrampf, H. Vollmer, and K. W. Wagner. On the power of number-theoretic operations with respect to counting. In Proceedings 10th Structure in Complexity Theory, pages 299-314, IEEE Computer Society Press, 1995.
18. B. Jenner, P. McKenzie, and D. Therien. Logspace and logtime leaf languages. Information and Computation, 129:21-33, 1996.
19. B. Jenner and J. Toran. Computing functions with parallel queries to NP. Theoretical Computer Science, 141:175-193, 1995.
20. J. Kobler. Strukturelle Komplexitdt von Anzahlproblemen. PhD thesis, Fakultat fur Informatik, Universitat Stuttgart, 1989.
21. J. Kobler, U. Schoning, and J. Toran. On counting and approximation. Acta Informatica, 26:363-379, 1989.
22. S. Kosub. A note on unambiguous function classes. Information Processing Letters, 72(5-6):197-203, 1999.
23. S. Kosub, H. Schmitz, and H. Vollmer. Uniformly defining complexity classes of functions. In Proceedings 15th Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 607-617. Springer Verlag, 1998.
24. M. W. Krentel. The complexity of optimization functions. Journal of Computer and System Sciences, 36:490-509, 1988.
25. M. W. Krentel. Generalizations of OptP to the polynomial hierarchy. Theoretical Computer Science, 97:183-198, 1992.
26. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, MA, 1994.
27. C. H. Papadimitriou. Personal communication, 1994.
28. C. H. Papadimitriou and S. Zachos. Two remarks on the power of counting. In Proceedings 6th GI Conference on Theoretical Computer Science, volume 145 of Lecture Notes in Computer Science, pages 269-275. Springer Verlag, 1983.
29. K. Regan and H. Vollmer. Gap-languages and log-time complexity classes. Theoretical Computer Science, 188:101-116, 1997.
30. H. Schmitz. Nichtdeterministische Polynomialzeit-Berechnung von Funktionen. Master's thesis, Institut fur Informatik, Universitat Wurzburg, 1996.
31. A. L. Selman. A taxonomy on complexity classes of functions. Journal of Computer and System Sciences, 48:357-381, 1994.
32. S. Toda. Computational Complexity of Counting Complexity Classes. PhD thesis, Department of Computer Science, Tokyo Institute of Technology, Tokyo, 1991.
33. S. Toda. PP is as hard as the polynomial time hierarchy. SIAM Journal on Computing, 20:865-877, 1991.
34. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
35. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal of Computing, 8(3):411-421, 1979.
36. N. K. Vereshchagin. Relativizable and non-relativizable theorems in the polynomial theory of algorithms. Izvestija Rossijskoj Akademii Nauk, 57:51-90, 1993. In Russian.
37. H. Vollmer. On different reducibility notions for function classes. In Proceedings 11th Symposium on Theoretical Aspects of Computer Science, volume 775 of Lecture Notes in Computer Science, pages 449-460. Springer Verlag, 1994.
38. H. VoUmer. Uniform characterizations of complexity classes. Complexity Theory Column 23, ACM-SIC ACT Newsletter, 30(l):17-27, 1999.
39. H. VoUmer and K. W. Wagner. The complexity of finding middle elements. International Journal of Foundations of Computer Science, 4:293-307, 1993.
40. H. VoUmer and K. W. Wagner. Complexity classes of optimization functions. Information and Computation, 120:198-219, 1995.