On deterministic approximation of DNF |
| |
Authors: | M Luby B Veličković |
| |
Affiliation: | (1) International Computer Science Institute, Berkeley;(2) University of California, 94720 Berkeley, CA, USA;(3) Equipe de Logique, Université Paris VII, Paris, France |
| |
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 > 0 an estimateY such that ¦PrF] –Y¦ in time which is
, for any constant. Although the algorithms themselves are deterministic, their analysis is probabilistic and uses the notion of limited independence between random variables.Research supported in part by National Science Foundation Operating Grant CCR-9016468, National Science Foundation Operating Grant CCR-9304722, United States-Israel Binational Science Foundation Grant No. 89-00312, United States-Israel Binational Science Foundation Grant No. 92-00226, and ESPRIT Basic Research Grant EC-US 030.Research partially done while visiting the International Computer Science Institute and while at Carnegie Mellon University. |
| |
Keywords: | Approximation algorithms #P-complete Derandomization DNF formula Small sample spaces |
本文献已被 SpringerLink 等数据库收录! |
|