Abstract
We develop efficient deterministic algorithms for approximating the fraction of truth assignments that satisfy a disjunctive normal form formula. Although the algorithms themselves are deterministic, their analysis is probabilistic and uses the notion of limited independence between random variables.
Cite
CITATION STYLE
APA
Luby, M., & Velitković, B. (1991). On deterministic approximation of DNF. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F130073, pp. 430–438). Association for Computing Machinery. https://doi.org/10.1145/103418.103464
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free