Minimizing disjunctive normal form formulas and AC0 circuits given a truth table

SIAM Journal on Computing

Volumn 38, Issue 1, 2008, Pages 63-84

  Allender, Eric ^a   Hellerstein, Lisa ^b   Mccabe, Paul ^c   Pitassi, Toniann ^c   Saks, Michael ^d  

^a RUTGERS UNIVERSITY   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

^d RUTGERS UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Complexity theory; Machine learning theory; Truth table minimization

Indexed keywords

BOOLEAN CIRCUITS; CIRCUIT SIZES; COMPLETE SETS; COMPLEXITY THEORY; COMPUTATIONAL PROBLEMS; CRYPTOGRAPHIC ASSUMPTIONS; DISJUNCTIVE NORMAL FORM FORMULAS; DISJUNCTIVE NORMAL FORMS; DNF FORMULAS; GENERAL CLASSES; GREEDY ALGORITHMS; MACHINE LEARNING THEORY; MINIMUM CIRCUIT SIZE PROBLEMS; OR GATES; POLYNOMIAL TIMES; SET COVERS; TRUTH TABLE MINIMIZATION; TRUTH TABLES;

APPROXIMATION ALGORITHMS; BOOLEAN FUNCTIONS; GATES (TRANSISTOR); LEARNING ALGORITHMS; LEARNING SYSTEMS; NUCLEAR PROPULSION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBABILITY DENSITY FUNCTION;

NETWORKS (CIRCUITS);

EID: 55249100776     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060664537     Document Type: Article

References (39)

1. A. AIZENSTEIN, T. HEGEDUS, L. HELLERSTEIN, AND L. PITT, Complexity theoretic hardness results for query learning, Comput. Complexity, 7 (1998), pp. 19-53.
2. M. ALEKHNOVICH, M. BRAVERMAN, V. FELDMAN, A. KLIVANS, AND T. PITASSI, Automatizability and learnability, in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy, 2004.
3. 0 circuits given a truth table, in Proceedings of the 21st Annual IEEE Conference on Computational Complexity, Prague, Czech Republic, 2006, pp. 237-251.
4. E. ALLENDER, M. KOUCKY, D. RONNEBERGER, AND S. ROY, Derandomization and distinguishing complexity, in Proceedings of the 18th Annual IEEE Conference on Computational Complexity, Aarhus, Denmark, 2003, pp. 209-220.
5. E. ALLENDER, M. KOUCKY, D. RONNEBURGER, AND S. ROY, Time-space tradeoffs in the counting hierarchy, in Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, IL, 2001, pp. 295-302.
6. N. ALON, D. MOSHKOVITZ, AND S. SAFRA, Algorithmic construction of sets for k- restrictions, ACM Trans. Algorithms, 2 (2006), pp. 153-177; also available online at http://www. informatik.uni-trier.de/%7Eley/db/journals/talg/talg2.html#AlonMS06 (2):153-177 (2006).
7. N. ALON, J. SPENCER, AND P. ERDOS, The Probabilistic Method, John Wiley & Sons, New York, 1992.
8. U. BERGGREN, Linear time deterministic learning of k-term DNF, in Proceedings of the 6th Annual ACM Conference on Computational Learning Theory, Santa Cruz, CA, USA, 1993, pp. 37-40.
9. N. BSHOUTY, R. CLEVE, R. GAVALDÀ, S. KANNAN, AND C. TAMON, Oracles and queries that are sufficient for exact learning, J. Comput. System Sci., 52 (1996), pp. 421-433.
10. N. H. BSHOUTY, Simple learning algorithms using divide arid conquer, Comput. Complexity, 6 (1997), pp. 174-194.
11. N. H. BSHOUTY AND L. BURROUGHS, On the proper learning of axis parallel concepts, in Proceedings of the 15th Annual Conference on Computational Learning Theory, Sydney, Australia, Lecture Notes in Comput. Sci. 2375, Springer-Verlag, Berlin, 2002, pp. 287-302.
12. A. CHANDRA AND G. MARKOWSKY, On the number of prime implicants, Discrete Math., 24 (1978), pp. 7-11.
13. V. CHVÁTAL, A greedy heuristic for the set covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.
14. O. COUDERT, Two-level logic minimization: An overview, Integration, the VLSI Journal, 17 (1994), pp. 97-140.
15. S. CZORT, The Complexity of Minimizing Disjunctive Normal Form Formulas, Master's thesis, University of Aarhus, 1999.
16. I. DINUR, V. GURUSWAMI, S. KHOT, AND O. REGEV, A new multilayered PCP and the hardness of hypergraph vertex cover, SIAM J. Comput., 34 (2005), pp. 1129-1146.
17. R. DOWNEY AND M. FELLOWS, Parameterized Complexity, Springer-Verlag, Berlin, 1999.
18. R. DUH AND M. FÜRER, Approximation of k-set cover by semi-local optimization, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, EI Paso, TX, 1997, pp. 256-264.
19. U. FEIGE, A threshold of In n for approximating set cover, J. ACM, 45 (1998), pp. 634-652.
20. V. FELDMAN, Hardness of Approximate Two-Level Logic Minimization and PAC Learning with Membership Queries, ECCC report TR05-127, 2005. Extended version to appear in Proceedings of the 38th Annual ACM Symposium on the Theory of Computing, 2006, pp. 363-372.
21. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
22. L. HELLERSTEIN AND V. RAGHAVAN, Exact learning of DNF formulas using DNF hypothesis, J. Comput. System Sci., 70 (2005), pp. 435-470.
23. D. S. HOCHBAUM, Approximation algorithms for the set covering and vertex cover problems, SIAM J. Comput., 11 (1982), pp. 555-556.
24. D. S. JOHNSON, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
25. V. KABANETS AND J. L. CAI, Circuit minimization problem, in Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, Portland, OR, 2000, pp. 73-79.
26. S. KHOT, online lecture notes for Probabilistically Checkable Proofs and Hardness of Approximation, Lecture 3 (scribed by Deeparnab Chakrabarti), available at http://www.cc.gatech. edu/̃khot/pcp-course.html.
27. E. KUSHILEVITZ, A simple algorithm for learning o(log n)-term DNF, Inform. Process. Lett., 61 (1997), pp. 289-292.
28. L. LOVÁSZ, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
29. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. ACM, 41 (1994), pp. 960-981.
30. W. J. MASEK, Some NP-Complete Set Covering Problems, manuscript, 1979.
31. M. NAOR AND O. REINGOLD, Number-theoretic constructions of efficient pseudorandom functions, J. ACM, 51 (2004), pp. 231-262.
32. V. A. NEPOMNJAŠČIǏ, Rudimentary predicates and luring calculations, Math. Dokl., 11 (1970), pp. 1462-1465.
33. K. PILLAIPAKKAMNATT AND V. RAGHAVAN, On the limits of proper learnability of subclasses of DNF formulas, Machine Learning, 25 (1996), pp. 237-263.
34. L. PITT AND L. G. VALIANT, Computational limitations on learning from examples, J. ACM, 35 (1988), pp. 965-984.
35. R. RAZ, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803.
36. A. A. RAZBOROV AND S. RUDICH, Natural proofs, J. Comput. System Sci., 55 (1997), pp. 24-35.
37. L. TREVISAN, Non-approximability results for optimization problems on bounded, degree instances, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, 2001, pp. 453-461.
38. 2 minimization problems, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, NY, 1999, pp. 465-474.
39. C. UMANS, T. VILLA, AND A. L. SANGIOVANNI-VINCENTELLI, Complexity of two-level logic minimization, IEEE Trans. CAD Integrated Circuits Syst., 25 (2006), pp. 1230-1246.