# On the connection between interval size functions and path counting

- 98 Downloads
- 2 Citations

## Abstract

We investigate the complexity of hard (#P-complete) counting problems that have easy decision version. By ‘easy decision,’ we mean that deciding whether the result of counting is nonzero is in P. This property is shared by several well-known problems, such as counting the number of perfect matchings in a given graph or counting the number of satisfying assignments of a given DNF formula. We focus on classes of such hard-to-count easy-to-decide problems which emerged through two seemingly disparate approaches: one taken by Hemaspaandra et al. (SIAM J Comput 36(5):1264–1300, 2007), who defined classes of functions that count the size of intervals of ordered strings, and one followed by Kiayias et al. (Lect Notes Comput Sci 2563:453–463, 2001), who defined the classTotP, consisting of functions that count the total number of paths of NP computations. We provide inclusion and separation relations between TotP and interval size counting classes, by means of new classes that we define in this work. Our results imply that many known #P-complete problems with easy decision are contained in the classes defined by Hemaspaandra et al., but are unlikely to be complete for these classes under reductions under which these classes are downward closed, e.g., parsimonious reductions. This, applied to the #MONSAT problem, partially answers an open question of Hemaspaandra et al. We also define a new class of interval size functions which strictly contains FP and is strictly contained in TotP under reasonable complexity-theoretic assumptions. We show that this new class contains hard counting problems.

## Keywords

Counting functions interval size functions path counting feasibility constraints easy decision## Subject classification

03D15 06A05 68Q05 68Q10 68Q15 68Q17## Preview

Unable to display preview. Download preview PDF.

## References

- Àlvarez Carme, Birgit Jenner (1993) A very hard log-space counting class. Theoretical Computer Science 107(1): 3–30MathSciNetCrossRefzbMATHGoogle Scholar
- Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis & Aris Tentes (2009). On the connection between interval size functions and path counting. In
*Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation*, volume 5532 of*Lecture Notes in Computer Science*, 108–117.Google Scholar - Dyer Martin E., Leslie Ann Goldberg, Greenhill Catherine S., Mark Jerrum (2003) The relative complexity of approximate counting problems. Algorithmica 38(3): 471–500MathSciNetCrossRefzbMATHGoogle Scholar
- Hemaspaandra Lane A., Homan Christopher M., Sven Kosub, Wagner Klaus W. (2007) The complexity of computing the size of an interval. SIAM Journal on Computing 36(5): 1264–1300MathSciNetCrossRefzbMATHGoogle Scholar
- Lane A. Hemaspaandra & Mitsunori Ogihara (2002).
*The Complexity Theory Companion*. Springer-Verlag Berlin Heidelberg.Google Scholar - Hempel Harald, Wechsung Gerd (2000) The operators min and max on the polynomial hierarchy. International Journal of Foundations of Computer Science 11(2): 315–342MathSciNetCrossRefzbMATHGoogle Scholar
- Jerrum Mark, Sinclair Alistair, Vigoda Eric (2004) A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM 51(4): 671–697MathSciNetCrossRefzbMATHGoogle Scholar
- Karp Richard M., Luby Michael, Madras Neal (1989) Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms 10(3): 429–448MathSciNetCrossRefzbMATHGoogle Scholar
- Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma & Stathis Zachos (2001). Acceptor-definable counting classes. In
*Proceedings of the 8th Panhellenic Conference on Informatics, Revised Selected Papers*, volume 2563 of*Lecture Notes in Computer Science*, 453–463.Google Scholar - Jingcheng Liu, Pinyan Lu & Chihao Zhang (2014). FPTAS for counting weighted edge covers. In
*Proceedings of the 22nd Annual European Symposium on Algorithms*, volume 8737 of Lecture Notes in Computer Science, 654–665.Google Scholar - Aris Pagourtzis (2001). On the complexity of hard counting problems with easy decision version. In
*Proceedings of the 3rd Panhellenic Logic Symposium*.Google Scholar - Aris Pagourtzis & Stathis Zachos (2006). The complexity of counting functions with easy decision version. In
*Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science*, volume 4162 of*Lecture Notes in Computer Science*, 741–752.Google Scholar - Saluja Sanjeev, Subrahmanyam K. V., Thakur Madhukar N. (1995) Descriptive complexity of #P functions. Journal of Computer and System Sciences 50(3): 493–505MathSciNetCrossRefzbMATHGoogle Scholar
- Toda Seinosuke (1991) PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing 20(5): 865–877MathSciNetCrossRefzbMATHGoogle Scholar
- Toda Seinosuke, Osamu Watanabe (1992) Polynomial time 1-Turing reductions from #PH to #P. Theoretical Computer Science 100(1): 205–221MathSciNetCrossRefzbMATHGoogle Scholar
- Leslie G. Valiant (1979a). The complexity of computing the permanent.
*Theoretical Computer Science***8**, 189–201.Google Scholar - Leslie G. Valiant (1979b). The complexity of enumeration and reliability problems.
*SIAM Journal on Computing***8**(3), 410–421.Google Scholar - Dror Weitz (2006). Counting independent sets up to the tree threshold. In
*Proceedings of the 38th Annual ACM Symposium on Theory of Computing*, 140–149.Google Scholar