Subtractive reductions and complete problems for counting complexity classes

Theoretical Computer Science

Volumn 340, Issue 3, 2005, Pages 496-513

  Durand, Arnaud ^a   Hermann, Miki ^b   Kolaitis, Phokion G ^c  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

^c University of California Santa Cruz   (United States)

Author keywords

Complete problems; Counting complexity; Subtractive reductions

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

COMPLETE PROBLEMS; COUNTING COMPLEXITY; HOMOGENEOUS SYSTEM; SUBTRACTIVE REDUCTIONS;

COMPUTER SCIENCE;

EID: 23844449132     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.012     Document Type: Conference Paper

References (22)

1. M. Cadoli The complexity of model checking for circumscriptive formulae Inform. Process. Lett. 44 3 1992 113 118
2. L.A. Hemachandra, and M. Ogiwara Is #P closed under subtraction? Bull. Eur. Assoc. Theoret. Comput. Sci. 46 February 1992 107 122
3. L.A. Hemaspaandra, and H. Vollmer The satanic notations: counting classes beyond # P and other definitional adventures SIGACT News 26 1 1995 2 13
4. M. Hermann, L. Juban, P.G. Kolaitis, On the complexity of counting the Hilbert basis of a linear Diophantine system, in: H. Ganzinger, D. McAllester, A. Voronkov (Eds.), Proc. 6th Internat. Conf. on Logic for Programming and Automated Reasoning (LPAR'99), Tbilisi (Republic of Georgia), Lecture Notes in Computer Science (in Artificial Intelligence), Vol. 1705, Springer, Berlin, September 1999, pp. 13-32.
5. N. Immerman Descriptive Complexity 1999 Springer Berlin
6. J. Köbler, U. Schöning, and J. Torán On counting and approximation Acta Inform. 26 4 1989 363 379
7. N. Linial Hard enumeration problems in geometry and combinatorics SIAM J. Algebraic Discrete Methods 7 2 1986 331 335
8. J. McCarthy Circumscription - a form of non-monotonic reasoning Artif. Intell. 13 1-2 1980 27 39
9. M. Ogiwara, and L.A. Hemachandra A complexity theory for feasible closure properties J. Comput. System Sci. 46 3 1993 295 325
10. J.S. Provan, and M.O. Ball The complexity of counting cuts and of computing the probability that a graph is connected SIAM J. Comput. 12 4 1983 777 788
11. S. Saluja, K.V. Subrahmanyam, and M.N. Thakur Descriptive complexity of #P functions J. Comput. System Sci. 50 3 1995 493 505
12. A. Schrijver Theory of Linear and Integer Programming 1986 Wiley New York
13. A. Sharell, Descriptive complexity and approximation of counting functions, Ph.D. Thesis, Université Paris 11, Orsay (France), February 1998.
14. L.J. Stockmeyer The polynomial-time hierarchy Theoret. Comput. Sci. 3 1 1976 1 22
15. S. Toda, Computational complexity of counting complexity classes, Ph.D. Thesis, Tokyo Institute of Technology, Department of Computer Science, Tokyo, Japan, 1991.
16. S. Toda, and O. Watanabe Polynomial-time 1-Turing reductions from #PH to #P Theoret. Comput. Sci. 100 1 1992 205 221
17. L.G. Valiant The complexity of computing the permanent Theoret. Comput. Sci. 8 2 1979 189 201
18. L.G. Valiant The complexity of enumeration and reliability problems SIAM J. Comput. 8 3 1979 410 421
19. K.W. Wagner The complexity of combinatorial problems with succinct input representation Acta Inform. 23 3 1986 325 356
20. K.W. Wagner Some observations on the connection between counting and recursion Theoret. Comput. Sci. 47 3 1986 131 147
21. C. Wrathall Complete sets and the polynomial-time hierarchy Theoret. Comput. Sci. 3 1 1976 23 33
22. V. Zankó #P-completeness via many-one reductions Internat. J. Found. Comput. Sci. 2 1 1991 77 82