Variable Influences in Conjunctive Normal Forms

Authors:
Patrick Traxler
Affiliations:
Institute of Theoretical Computer Science, ETH Zürich, Switzerland
Venue:
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Year:
2009

Citing 17
Cited 1

NP-completeness of some problems concerning voting games

International Journal of Game Theory
Improved learning of AC0 functions

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Constant depth circuits, Fourier transform, and learnability

Journal of the ACM (JACM)
On the degree of Boolean functions as real polynomials

Computational Complexity - Special issue on circuit complexity
The average sensitivity of bounded-depth circuits

Information Processing Letters
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
NP-completeness for calculating power indices of weighted majority games

Theoretical Computer Science
Every decision tree has an in.uential variable

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Thresholds and Expectation Thresholds

Combinatorics, Probability and Computing
Computing the Banzhaf power index in network flow games

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs

Journal of Computer and System Sciences
Counting truth assignments of formulas of bounded tree-width or clique-width

Discrete Applied Mathematics
Some topics in analysis of boolean functions

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The influence of variables on Boolean functions

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Approximating power indices

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Model counting: a new strategy for obtaining good bounds

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Approximation by DNF: examples and counterexamples

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

On extremal k-CNF formulas

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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 .