Uniformly defining complexity classes of functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1373 LNCS, Issue , 1998, Pages 607-617

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

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY CLASS; COUNTING CLASS; FUNCTION CLASS; POLYNOMIAL-TIME; SUFFICIENT CRITERION;

COMPUTER SCIENCE; POLYNOMIAL APPROXIMATION;

INCLUSIONS;

EID: 23844535290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028595     Document Type: Conference Paper

References (28)

1. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Texts in Theoretical Computer Science. Springer-Verlag, Berlin Heidelberg, 2nd edition, 1995.
2. R. V. Book, T. Long, and A. Selman. Quantitative relativizations of complexity classes. SIAM Journal on Computing, 13:461-487, 1984.
3. B. Borchert. Predicate classes, promise classes, and the acceptance power of regular languages. PhD thesis, Naturwissenschaftlich-Mathematische Fakultät, Universität Heidelberg, 1994.
4. D. P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. International Series in Computer Science. Prentice Hall, London, 1994.
5. D. P. Bovet, P. Crescenzi, and R. Silvestri. A uniform approach to define complexity classes. Theoretical Computer Science, 104:263-283, 1992.
6. S. Fenner, L. Fortnow, and S. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48:116-148, 1994.
7. C. Glaßer and G. Wechsung. Relativizing function classes. Manuscript, 1997.
8. L. Hemaspaandra and H. Vollmer. The satanic notations: counting classes beyond #P and other definitional adventures. Complexity Theory Column 8, ACM SIGACT-Newsletter, 26(1):2-13, 1995.
9. H. Hempel and G. Wechsung. The operators min and max on the polynomial hierarchy. In Proceedings 14th Symposium on Theoretical Aspects of Computer Science, volume 1200 of Lecture Notes in Computer Science, pages 93-104. Springer-Verlag, 1997.
10. 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.
11. 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, 1993.
12. 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, 1995.
13. B. Jenner, P. McKenzie, and D. Thérien. Logspace and logtime leaf languages. In 9th Annual Conference Structure in Complexity Theory, pages 242-254, 1994.
14. B. Jenner and J. Torán. Computing functions with parallel queries to NP. Theoretical Computer Science, 141:175-193, 1995.
15. J. Köbler. Strukturelle Komplexität von Anzahlproblemen. PhD thesis, Universität Stuttgart, Fakultät für Informatik, 1989.
16. J. Köbler, U. Schöning, and J. Torán. On counting and approximation. Acta Informatica, 26:363-379, 1989.
17. S. Kosub. On cluster machines and function classes. Technical Report 172, Institut für Informatik, Universität Würzburg, 1997.
18. M. W. Krentel. The complexity of optimization functions. Journal of Computer and System Sciences, 36:490-509, 1988.
19. M. W. Krentel. Generalizations of OptP to the polynomial hierarchy. Theoretical Computer Science, 97:183-198, 1992.
20. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, MA, 1994.
21. H. Schmitz. Nichtdeterministische Polynomialzeit-Berechnung von Funktionen. Master's thesis, Institut für Informatik, Universität Würzburg, 1996.
22. A. Selman. A taxonomy on complexity classes of functions. Journal of Computer and System Sciences, 48:357-381, 1994.
23. S. Toda. PP is as hard as the polynomial time hierarchy. SIAM Journal on Computing, 20:865-877, 1991.
24. L. G. Valiant. The complexity of enumeration and reliabilty problems. SIAM Journal of Computing, 8(3):411-421, 1979.
25. N. K. Vereshchagin. Relativizable and non-relativizable theorems in the polynomial theory of algorithms. Izvestija Rossijskoj Akademii Nauk, 57:51-90, 1993. In Russian.
26. 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.
27. H. Vollmer and K. W. Wagner. The complexity of finding middle elements. International Journal of Foundations of Computer Science, 4:293-307, 1993.
28. H. Vollmer and K. W. Wagner. Complexity classes of optimization functions. Information and Computation, 120:198-219, 1995.