Recursion theoretic characterizations of complexity classes of counting functions

Theoretical Computer Science

Volumn 163, Issue 1-2, 1996, Pages 245-258

  Vollmer, Heribert ^a   Wagner, Klaus W ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS;

COMPLEXITY CLASSES; COUNTING FUNCTIONS; MACHINE INDEPENDENT CHARACTERIZATION;

RECURSIVE FUNCTIONS;

EID: 0030212604     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00237-5     Document Type: Article

References (26)

1. L. Babai and L. Fortnow, Arithmetization: A new method in structural complexity theory, Comput. Complexity 1 (1991) 41-66.
2. J.L. Balcázar, J. Díaz and J. Gabarró, Structural Complexity I (Springer, Berlin, 2nd ed., 1995).
3. k and NC, in: S.R. Buss and P.J. Scott, eds., Feasible Mathematics (Birkhäuser, Boston, 1990) 49-69.
4. P. Clote, Bounded arithmetic and computational complexity, in: Proc. 5th Structure in Complexity Theory Conf. (1990) 186-199.
5. A. Cobham, The intrinsic computational complexity of functions, in: Proc. 1964 Internat. Conf. on Logic, Methodology and Philosophy of Science (1964) 24-30.
6. M. Davis, Arithmetical problems and recursively enumerable predicates, J. Symbolic Logic 18 (1953) 33-41.
7. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R. Karp, ed., The Complexity of Computation, SIAM-AMS Proc., Vol. 7 (American Mathematical Society, Providence RI, 1974) 43-73.
8. S. Fenner, L. Fortnow and S. Kurtz, Gap-definable counting classes, J. Comput. System Sci. 48 (1994) 116-148.
9. J. Gill, Computational complexity of probabilistic complexity classes, SIAM J. Comput. 6 (1977) 675-695.
10. U. Hertrampf, H. Vollmer and K.W. Wagner, On the power of number-theoretic operations with respect to counting, in: Proc. 10th Structure in Complexity Theory Conf. (1995) 299-314.
11. B. Hodgson and C. Kent, A normal for arithmatical representations of NP-sets, J. Comput. System Sci. 21 (1993) 378-388.
12. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, MA, 1979).
13. N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987) 760-778.
14. N. Immerman, Expressibility and parallel complexity, SIAM J. Comput. 18 (1989) 625-638.
15. C. Kent and B. Hodgson, An arithmetical characterization of NP, Theoret. Comput. Sci. 21 (1982) 255-267.
16. M. Ogiwara and L. Hemachandra, A complexity theory for feasible closure properties, J. Comput. System Sci. 46 (1993) 295-325.
17. S. Saluja, K.V. Subrahmanyam and M.N. Thakur, Descriptive complexity of #P functions, in: Proc. 7th Structure in Complexity Theory Conf. (1992) 169-184.
18. A. Shamir, IP = PSPAGE, in: Proc. 31st Symp. on Foundations of Computer Science (1990) 11-15.
19. M. Sipser, The history and status of the P versus NP question, in: Proc. 14th Symp. on the Theory of Computing (1992) 603-618.
20. T. Thierauf, S. Toda and O. Watanabe, On closure properties of Gap-P, Comput. Complexity 4 (1994) 242-261.
21. S. Toda, PP is as hard as the polynomial time hierarchy, SIAM J. Comput. 20 (1991) 865-877.
22. L.G. Valiant, Relative complexity of checking and evaluation, Inform. Process. Lett. 5 (1976) 20-23.
23. L.G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979) 189-201.
24. H. Vollmer and K.W. Wagner, Complexity classes of optimization function, Inform. and Comput. 120 (1995) 198-219.
25. K.W. Wagner, Some observations on the connection between counting and recursion, Theoret. Comput. Sci. 47 (1986) 131-147.
26. K.W. Wagner and G. Wechsung, Computational Complexity (Deutscher Verlag der Wissenschaften, Berlin, 1986).