Skip to main content
SpringerLink
Log in

Variable Influences in Conjunctive Normal Forms

  • Conference paper
Theory and Applications of Satisfiability Testing - SAT 2009 (SAT 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5584))

Abstract

We provide an upper bound on the total influence of Boolean functions defined by k-cnfs. Our bound is nearly optimal. We achieve it by an extension and appropriate use of an algorithm of Paturi, Pudlák, and Zane. We also discuss applications to prove and compute lower bounds for the maximum clause width k.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bachrach, Y., Markakis, E., Procaccia, A.D., Rosenschein, J.S., Saberi, A.: Approximating power indices. In: Proc. of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 943–950 (2008)

    Google Scholar 

  2. Bachrach, Y., Rosenschein, J.S.: Computing the Banzhaf power index in network flow games. In: Proc. of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 335–340 (2007)

    Google Scholar 

  3. Beame, P.: A switching lemma primer. Technical Report UW-CSE-95-07-01, Department of Computer Science and Engineering, University of Washington (November 1994)

    Google Scholar 

  4. Boppana, R.B.: The average sensitivity of bounded-depth circuits. Information Processing Letters 63(5), 257–261 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  5. Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of Unique k-SAT: An isolation lemma for k-CNFs. J. Computer and System Sciences 74(3), 386–393 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fischer, E., Makowsky, J.A., Ravve, E.V.: Counting truth assignments of formulas of bounded tree-width or clique-width. Discrete Applied Mathematics 156(4), 511–529 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Furst, M.L., Jackson, J.C., Smith, S.W.: Improved learning of AC0 functions. In: Proc. of the 4th Annual ACM Conference on Computational Learning Theory, pp. 317–325 (1991)

    Google Scholar 

  8. Gomes, C.P., Sabharwal, A., Selman, B.: Model counting: A new strategy for obtaining good bounds. In: Proc. of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference (2006)

    Google Scholar 

  9. Håstad, J.: A slight sharpening of LMN. J. Computer and System Sciences 63(3), 498–508 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hirsch, E.A.: A fast deterministic algorithm for formulas that have many satisfying assignments. Logic Journal of the IGPL 6(1), 59–71 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Computer and System Sciences 62(2), 367–375 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kahn, J., Kalai, G.: Thresholds and expectation thresholds. Combinatorics, Probability and Computing 16(3), 495–502 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kahn, J., Kalai, G., Linial, N.: The influence of variables on boolean functions. In: Proc. of the 29th Annual IEEE Symposium on Foundations of Computer Science, pp. 68–80 (1988)

    Google Scholar 

  14. Kalai, G., Safra, S.: Threshold phenomena and influence, with some perspectives from mathematics, computer science, and economics. Discussion Paper Series dp398, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem (August 2005)

    Google Scholar 

  15. Klinz, B., Woeginger, G.J.: Faster algorithms for computing power indices in weighted voting games. Mathematical Social Sciences 49(1), 111–116 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, Fourier transform, and learnability. J. ACM 40(3), 607–620 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  17. Matsui, Y., Matsui, T.: NP-completeness for calculating power indices of weighted majority games. Theoretical Computer Science 263(1-2), 305–310 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Nisan, N., Szegedy, M.: On the degree of boolean functions as real polynomials. Computational Complexity 4, 301–313 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  19. O’Donnell, R.: Some topics in analysis of boolean functions. In: Proc. of the 40th Annual ACM Symposium on Theory of Computing, pp. 569–578 (2008)

    Google Scholar 

  20. O’Donnell, R., Saks, M.E., Schramm, O., Servedio, R.A.: Every decision tree has an influential variable. In: Proc. of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 31–39 (2005)

    Google Scholar 

  21. O’Donnell, R., Wimmer, K.: Approximation by DNF: Examples and counterexamples. In: Proc. of the 34th International Colloquium on Automata, Languages and Programming, pp. 195–206 (2007)

    Google Scholar 

  22. Paturi, R., Pudlák, P., Zane, F.: Satisfiability coding lemma. Chicago J. Theoretical Computer Science 1999(115) (1999)

    Google Scholar 

  23. Prasad, K., Kelly, J.S.: NP-completeness of some problems concerning voting games. International Journal of Game Theory 19(1), 1–9 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  24. Trevisan, L.: A note on approximate counting for k-DNF. In: Proc. of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, and 8th International Workshop on Randomization and Computation, pp. 417–426 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zürich, Switzerland

    Patrick Traxler

Authors
  1. Patrick Traxler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Swansea University, Faraday Building, Singleton Park, SA2 8PP, Swansea, UK

    Oliver Kullmann

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Traxler, P. (2009). Variable Influences in Conjunctive Normal Forms. In: Kullmann, O. (eds) Theory and Applications of Satisfiability Testing - SAT 2009. SAT 2009. Lecture Notes in Computer Science, vol 5584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02777-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02777-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02776-5

  • Online ISBN: 978-3-642-02777-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation