Advertisement

Counting Problems

  • Vijay V. Vazirani

Abstract

The techniques for approximately counting the number of solutions to #P-complete problems are quite different from those for obtaining approximation algorithms for NP-hard optimization problems. Much of the former theory is built around the Markov chain Monte Carlo method, see Section 28.4 for references. In this chapter, we will present combinatorial algorithms (not using Markov chains) for two fundamental problems, counting the number of satisfying truth assignments for a DNF formula, and estimating the failure probability of an undirected network.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 257.
    L.G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8: 189–201, 1979.MathSciNetCrossRefGoogle Scholar
  2. 172.
    R.M. Karp and M. Luby. Monte Carlo algorithms for enumeration and reliability problems. In Proc. 24th IEEE Annual Symposium on Foundations of Computer Science, pages 56–64, 1983.Google Scholar
  3. 173.
    R.M. Karp, M. Luby, and N. Madras. Monte Carlo approximation algorithms for enumeration problems. Journal of Algorithms, 10: 429–448, 1989.MathSciNetCrossRefGoogle Scholar
  4. 163.
    D. Karger. A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM Journal on Computing, 29: 492–514, 1999.MathSciNetCrossRefGoogle Scholar
  5. 34.
    A.Z. Broder. How hard is it to marry at random? In Proc. 18th ACM Symposium on the Theory of Computing, pages 50–58, 1986.Google Scholar
  6. 213.
    M. Mihail. On coupling and the approximation of the permanent. Information Processing Letters, 30: 91–95, 1989.MathSciNetCrossRefGoogle Scholar
  7. 152.
    M.R. Jerrum and A. Sinclair. Approximating the permanent. SIAM Journal on Computing, 18: 1149–1178, 1989.MathSciNetCrossRefGoogle Scholar
  8. 68.
    A. Durand, M. Hermann, and P. G. Kolaitis. Subtractive reductions and complete problems for counting complexity classes. In M. Nielsen and B. Rovan, editors, Proceedings 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), Bratislava (Slovakia), volume 1893 of Lecture Notes in Computer Science, pages 323–332. Springer-Verlag, 2000.Google Scholar
  9. 149.
    M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method: an approach to approximate counting. In D.S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 482–520. PWS Publishing, Boston, MA, 1997.Google Scholar
  10. 250.
    A. Sinclair. Algorithms for Random Generation and Counting: a Markov Chain Approach. Birkhäuser, Boston, MA, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations