The chain method to separate counting classes

Theory of Computing Systems

Volumn 31, Issue 1, 1998, Pages 93-108

  Cronauer, K ^a   Hertrampf, U ^b   Vollmer, H ^a   Wagner, K W ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES;

COUNTING CLASS;

COMPUTER SCIENCE;

EID: 0032342034     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000080     Document Type: Article

References (27)

1. E. Allender, Oracles versus proof techniques that do not relativize, Proceedings of the 1st International Symposium on Algorithms (1990), LNCS 450, Springer-Verlag, Berlin, pp. 39-52.
2. E. Allender, K. W. Wagner, Counting hierarchies: polynomial time and constant depth circuits, Bulletin of the EATCS 40 (1990), 182-194.
3. T. Baker, J. Gill, R. Solovay, Relativizations of the P (Questioned equal to) NP question, SIAM Journal on Computing 4 (1975), 431-442.
4. A. Blass, Y Gurevich, On the unique satisfiability problem, Information and Control 55 (1982), 80-88.
5. D. P. Bovet, P. Crescenzi, R. Silvestri, A uniform approach to define complexity classes, Theoretical Computer Science 104 ( 1992), 263-283.
6. K. Cronauer, Ein Kriterium zur Trennung von Komplexitätsklassen durch Orakel, Diplomarbeit Universität Würzburg (1993).
7. S. Fenner, L. Fortnow, S. Kurtz, Gap-definable counting classes, Journal of Computer and System Sciences 48 (1994), 116-148.
8. J. Gill, Computational complexity of probabilistic complexity classes, SIAM Journal on Computing 6 (1977), 675-695.
9. T. Gundermann, N. A. Nasser, G. Wechsung, A survey on counting classes, Proceedings of the 5th Structure in Complexity Theory Conference (1990), pp. 140-153.
10. T. Gundermann, G. Wechsung, Counting classes of finite acceptance types, Computers and Artificial Intelligence 6 (1987), 395-409.
11. U. Hertrampf, Complexity classes with finite acceptance types, Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science (1994), LNCS 775, Springer-Verlag, Berlin, pp. 543-553.
12. U. Hertrampf, Über Komplexitätsklassen, die mit Hilfe k-wertiger Funktionen definiert werden, Habilitationsschrift, Universität Würzburg (1994).
13. U. Hertrampf, Classes of bounded counting type and their inclusion relations; submitted for publication. A preliminary version appeared in the Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science (1995), LNCS 900, Springer-Verlag, Berlin, pp. 60-70.
14. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K. W. Wagner, On the power of polynomial time bit-reductions, Proceedings of the 8th Structure in Complexity Theory Conference (1993), pp. 200-207.
15. U. Hertrampf, H. Vollmer, K. W. Wagner, On balanced versus unbalanced computation trees, Mathematical Systems Theory 29 (1996), 411-421.
16. U. Hertrampf, H. Vollmer, K. W. Wagner, On the power of number-theoretic operations with respect to counting, Proceedings of the 10th Structure in Complexity Theory Conference (1995), pp. 299-314.
17. B. Jenner, P. McKenzie, D. Thérien, Logspace and logtime leaf languages, Proceedings of the 9th Structure in Complexity Theory Conference (1994), pp. 242-254.
18. J. Köbler, U. Schöning, K. W. Wagner, The difference and truth-table hierarchies for NP, Theoretical Informatics and Applications 21 (1987), 419-435.
19. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, Mass. (1994).
20. J. Simon, On Some Central Problems in Complexity Theory, Dissertation, Cornell University (1975).
21. J. Torán, Structural Properties of the Counting Hierarchies, Dissertation, Facultat d'Informàtica de Barcelona, 1988.
22. J. Torán, Complexity classes defined by counting quantifiers, Journal of the ACM 38 (1991), 753-774.
23. L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science 8 (1979), 189-201.
24. N. K. Vereshchagin, Relativizable and non-relativizable theorems in the polynomial theory of algorithms, Izvestija Rossijskoj Akademii Nauk 56 (1993), 51-90. In Russian.
25. K. W. Wagner, Some observations on the connection between counting and recursion, Theoretical Computer Science 47 (1986), 131-147.
26. K. W. Wagner, The complexity of combinatorial problems with succinct input representation, Acta Informatica 23 (1986), 325-356.
27. G. Wechsung, K. Wagner, On the boolean closure of NP, Proceedings of the Conference on Fundamentals of Computation Theory (1985), LNCS 199, Springer-Verlag, Berlin, pp. 485-493.