The complexity of counting functions with easy decision version

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

Volumn 4162 LNCS, Issue , 2006, Pages 741-752

  Pagourtzis, Aris ^a   Zachos, Stathis ^a,b  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; TURING MACHINES;

COMPLEXITY CLASS; COMPUTATION PATHS; COUNTING PROBLEMS;

FUNCTIONS;

EID: 33750084182     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_64     Document Type: Conference Paper

References (21)

1. [AJ90] C. Àlvarez, B. Jenner. A very hard log space counting class. In Proceedings of Structure in Complexity Theory Conference 1990: 154-168.
2. [DHK00] A. Durand, M. Hermann, and P. G. Kolaitis. Subtractive reductions and complete problems for counting complexity classes. Theoretical Computer Science 340(3): 496-513, 2005.
3. [DGGJ03] M. Dyer, L. A. Goldberg, C. Greenhill, and M. Jerrum. On the relative complexity of approximate counting problems. Algorithmica 38(3): 471-500 (2003).
4. [HHKW05] L.A. Hemaspaandra, C.M. Homan, S. Kosub, and K.W. Wagner. The complexity of computing the size of an interval. Technical Report cs.cc/0502058, ACM Computing Research Repository, February 2005. (Preliminary version: L.A. Hemaspaandra, S. Kosub, and K.W. Wagner, The complexity of computing the size of an interval, in Proceedings ICALP 2001, LNCS 2076, pp. 1040-1051, Springer 2001.)
5. [JS96] M. Jerrum and A. Sinclair. The Markov chain Monte-Carlo method: an approach to approximate counting and integration. In Approximation Algorithms for NP-hard Problems (Dorit Hochbaum, ed.), PWS, pp. 482-520, 1996.
6. [KLM89] R.M. Karp, M. Luby, and N. Madras. Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms 10: 429-448 (1989).
7. [KPSZ98] A. Kiayias, A. Pagourtzis, K. Sharma, and S. Zachos. The complexity of determining the order of solutions. In Proceedings of the First Southern Symposium on Computing, Hattiesburg, Mississippi, 4-5 December 1998.
8. [KPZ99] A. Kiayias, A. Pagourtzis, and S. Zachos. Cook Reductions Blur Structural Differences Between Functional Complexity Classes. In Proceedings of the 2nd Panhellenic Logic Symposium, pp. 132-137, Delphi, 13-17 July 1999.
9. [Ko83] On Self-Reducibility and Weak P-Selectivity. Journal of Computer and System Sciences, 26(2):209-221, 1983.
10. [Kre88] M. W. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36(3):490-509, June 1988.
11. [KST89] J. Köhler, U. Schöning, and J. Torán. On counting and approximation. Acta Informatica, 26(4):363-379, 1989.
12. [Pag01] A. Pagourtzis. On the complexity of hard counting problems with easy decision version. In Proceedings of the 3rd Panhellenic Logic Symposium, Anogia, Crete, 17-21 July 2001.
13. [SST95] S. Saluja, K. V. Subrahmanyam, and M. N. Thakur. Descriptive Complexity of #P Functions. Journal of Computer and System Sciences, 50(3): 493-505 (1995).
14. [Sim75] J. Simon. On some Central Problems of Computational Complexity. PhD thesis, Cornell University, Ithaca, NY, 1975.
15. [Tod91] S. Toda. PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing, 20(5):865-877, 1991.
16. [TW92] S. Toda and O. Watanabe. Polynomial-time 1-Turing reductions from #PH to #P. Theoretical Computer Science, 100(1):205-221, 1992.
17. [Tor88] J. Toran. Structural Properties of the Counting Hierarchies. PhD thesis, Facultat d'Informatica de Barcelona, 1988.
18. [Val79a] L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8(2): 189-201, April 1979.
19. [Val79b] L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, August 1979.
20. [Vol94] H. Vollmer. On different reducibility notions for function classes. In Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, volume 775 of Lecture Notes in Computer Science, pages 449-460, Caen, France, 24-26 February 1994. Springer.
21. [Wag86] K. W. Wagner. Some observations on the connection between counting and recursion. Theoretical Computer Science, 47(2):131-147, 1986.