The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments

  • Patrick TraxlerEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8894)


We study the exponential time complexity of approximate counting satisfying assignments of CNFs. We reduce the problem to deciding satisfiability of a CNF. Our reduction preserves the number of variables of the input formula and thus also preserves the exponential complexity of approximate counting. Our algorithm is also similar to an algorithm which works particularly well in practice and for which no approximation guarantee is known.


Boolean Function Hash Function Main Lemma Satisfying Assignment Extraction Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Beckner, W.: Inequalities in Fourier analysis. Ann. Math. 102, 159–182 (1975)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Bonami, A.: Étude des coefficients des Fourier de fonctions de \(L\mathit{^p(G})\). Annales de l’Institut Fourier 20(2), 335–402 (1970)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of unique \(k\)-SAT: an isolation lemma for \(k\)-CNFs. J. Comput. Syst. Sci. 74(3), 386–393 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Calabro, C., Impagliazzo, R., Paturi, R. A duality between clause width and clause density for SAT. In: Proceedings of the 21st Annual IEEE Conference on Computational Complexity, pp. 252–260 (2006)Google Scholar
  5. 5.
    Calabro, C., Impagliazzo, R., Paturi, R.: On the exact complexity of evaluating quantified k-CNF. Algorithmica 65(4), 817–827 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Chor, B., Goldreich, O.: On the power of two-point based sampling. J. Complex. 5(1), 96–106 (1989)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Cooper, C.: On the rank of random matrices. Random Struct. Algorithms 16(2), 209–232 (2000)CrossRefzbMATHGoogle Scholar
  8. 8.
    de Wolf, R.: A brief introduction to Fourier analysis on the Boolean cube. Theory Comput. Libr. Grad. Surv. 1, 6 (2008)Google Scholar
  9. 9.
    Ermon, S., Gomes, C.P., Sabharwal, A., Selman, B.: Taming the curse of dimensionality: discrete integration by hashing and optimization. In: Proceedings of the 30th International Conference on Machine Learning, pp. 334–342 (2013)Google Scholar
  10. 10.
    Ermon, S., Gomes, C.P., Sabharwal, A., Selman, B.: Low-density parity constraints for hashing-based discrete integration. In: Proceedings of the 31th International Conference on Machine Learning, pp. 271–279 (2014)Google Scholar
  11. 11.
    Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separations for one-way quantum communication complexity, with applications to cryptography. SIAM J. Comput. 38(5), 1695–1708 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Gomes, C.P., Sabharwal, A., Selman, B.: Model counting: a new strategy for obtaining good bounds. In: Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference (2006)Google Scholar
  13. 13.
    Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 12–24 (1989)Google Scholar
  14. 14.
    Impagliazzo, R, Matthews, W., Paturi, R.: A satisfiability algorithm for AC0. In: Proceedings of the 23th ACM-SIAM Symposium on Discrete Algorithms, pp. 961–972 (2012)Google Scholar
  15. 15.
    Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512–530 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Jerrum, M., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci. 43, 169–188 (1986)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Jukna, S.: Extremal Combinatorics. Springer, Heidelberg (2001)CrossRefzbMATHGoogle Scholar
  18. 18.
    O’Donnell, R.: Some topics in analysis of boolean functions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 569–578 (2008)Google Scholar
  19. 19.
    Stockmeyer, L.J.: On approximation algorithms for #P. SIAM J. Comput. 14(4), 849–861 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Thurley, M.: An approximation algorithm for #k-SAT. In: Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, pp. 78–87 (2012)Google Scholar
  21. 21.
    Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theor. Comput. Sci. 47(1), 85–93 (1986)CrossRefzbMATHMathSciNetGoogle Scholar
  22. 22.
    Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci. 348(2–3), 357–365 (2005)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Software Competence Center HagenbergHagenbergAustria

Personalised recommendations