Abstract
We develop several quasi-polynomial-time deterministic algorithms for approximating the fraction of truth assignments that satisfy a disjunctive normal form formula. The most efficient algorithm computes for a given DNF formulaF onn variables withm clauses and e > 0 an estimateY such that ¦Pr[F] −Y¦≤e in time which is $$(m\log (n))^{\exp (O(\sqrt {\log \log (m)} ))}$$ , for any constante. Although the algorithms themselves are deterministic, their analysis is probabilistic and uses the notion of limited independence between random variables.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.