Pseudorandomness for read-k DNF formulas.
SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019(2019)
摘要
The design of pseudorandom generators and deterministic approximate counting algorithms for DNF formulas are important challenges in unconditional derandomization. Numerous works on these problems have focused on the subclass of small-read DNF formulas, which are formulas in which each variable occurs a bounded number of times.
Our first main result is a pseudorandom generator which ε-fools M-term read-k DNFs using seed length poly(k, log(1/ε)) · log M + O(log n). This seed length is exponentially shorter, as a function of both k and 1/ε, than the best previous PRG for read-k DNFs. We also give a deterministic algorithm that approximates the number of satisfying assignments of an M-term read-k DNF to any desired (1 + ε)-multiplicative accuracy in time poly(n) · min{(M/ε)poly(k,log(k/ε)), (M/ε)Õ(log((k log M)/ε))}.
For any constant k this is a PTAS, and our runtime remains almost-polynomial (MÕ(log log M)) for k as large as any polylog(M). Prior to our work, the fastest deterministic algorithm ran in time MÕ (log M) even for k = 2, and no PTAS was known for any non-trivial subclass of DNFs. The common essential ingredients in these pseudorandomness results are new analytic inequalities for read-k DNFs. These inequalities may be of independent interest and utility; as an example application, we use them to obtain a significant improvement on the previous state of the art for agnostically learning read-k DNFs.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络