Minimizing DNF formulas and AC/sup 0//sub d/ circuits given a truth table

For circuit classes R, the fundamental computational problem Min-R asks for the minimum R-size of a Boolean function presented as a truth table. Prominent examples of this problem include Min-DNF, which asks whether a given Boolean function presented as a truth table has a k-term DNF, and Min-Circuit (also called MCSP), which asks whether a Boolean function presented as a truth table has a size k Boolean circuit. We present a new reduction proving that Min-DNF is NP-complete. It is significantly simpler than the known reduction of Masek (1979), which is from Circuit-SAT. We then give a more complex reduction, yielding the result that Min-DNF cannot be approximated to within a factor smaller than (log N)Upsi, for some constant Upsi > 0, assuming that NP is not contained in quasipolynomial time. The standard greedy algorithm for set cover is often used in practice to approximate Min-DNF. The question of whether Min-DNF can be approximated to within a factor of o(log N) remains open, but we construct an instance of Min-DNF on which the solution produced by the greedy algorithm is Omega(log N) larger than optimal. Finally, we extend known hardness results for Min-TC0 d to obtain new hardness results for Min-AC 0 d, under cryptographic assumptions

[1]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[2]  Venkatesan Guruswami,et al.  A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..

[3]  Nader H. Bshouty,et al.  On the Proper Learning of Axis-Parallel Concepts , 2002, J. Mach. Learn. Res..

[4]  Nader H. Bshouty,et al.  Simple learning algorithms using divide and conquer , 1995, COLT '95.

[5]  Ran Raz,et al.  PCP characterizations of NP: towards a polynomially-small error-probability , 1999, STOC '99.

[6]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[7]  Leslie G. Valiant,et al.  Computational limitations on learning from examples , 1988, JACM.

[8]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[9]  Lisa Hellerstein,et al.  Exact learning of DNF formulas using DNF hypotheses , 2002, STOC '02.

[10]  Noga Alon,et al.  Algorithmic construction of sets for k-restrictions , 2006, TALG.

[11]  C. Umans.  Hardness of Approximating p 2 Minimization Problems , 1999 .

[12]  Rong-chii Duh,et al.  Approximation of k-set cover by semi-local optimization , 1997, STOC '97.

[13]  Eric Allender,et al.  Derandomization and distinguishing complexity , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[14]  Jan Krajícek,et al.  Some Consequences of Cryptographical Conjectures for S_2^1 and EF , 1994, LCC.

[15]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[16]  Eric Allender,et al.  Time-space tradeoffs in the counting hierarchy , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[17]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[18]  Mark Braverman,et al.  Learnability and automatizability , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[19]  Leslie G. Valiant,et al.  Cryptographic limitations on learning Boolean formulae and finite automata , 1994, JACM.

[20]  Sampath Kannan,et al.  Oracles and Queries That Are Sufficient for Exact Learning , 1996, J. Comput. Syst. Sci..

[21]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[22]  C. Umans.  Hardness of Approximating Minimization Problems , 1999, FOCS 1999.

[23]  Jin-Yi Cai,et al.  Circuit minimization problem , 2000, STOC '00.

[24]  Ulf Berggren.  Linear time deterministic learning of k-term DNF , 1993, COLT '93.

[25]  CoudertOlivier.  Two-level logic minimization: an overview , 1994 .

[26]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[27]  Lisa Hellerstein,et al.  Complexity theoretic hardness results for query learning , 1998, computational complexity.

[28]  Olivier Coudert,et al.  Two-level logic minimization: an overview , 1994, Integr..

[29]  Lisa Hellerstein,et al.  Exact learning of DNF formulas using DNF hypotheses , 2005, J. Comput. Syst. Sci..

[30]  Vijay Raghavan,et al.  On the Limits of Proper Learnability of Subclasses of DNF Formulas , 1994, COLT '94.

[31]  NaorMoni,et al.  Number-theoretic constructions of efficient pseudo-random functions , 2004 .

[32]  Tiziano Villa,et al.  Complexity of two-level logic minimization , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[33]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[34]  Leslie G. Valiant,et al.  Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.

[35]  Eyal Kushilevitz.  A simple algorithm for learning O(log n)-term DNF , 1996, COLT '96.

[36]  George Markowsky,et al.  On the number of prime implicants , 1978, Discret. Math..

[37]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[38]  Christopher Umans.  The minimum equivalent DNF problem and shortest implicants , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[39]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[40]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[41]  Valentine Kabanets.  Easiness Assumptions and Hardness Tests: Trading Time for Zero Error , 2001, J. Comput. Syst. Sci..

[42]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[43]  Lisa Hellerstein,et al.  Minimizing DNF Formulas and AC0 Circuits Given a Truth Table , 2005, Electron. Colloquium Comput. Complex..

[44]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[45]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[46]  Valentine Kabanets,et al.  Easiness assumptions and hardness tests: trading time for zero error , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.