Inimizing DNF formulas and ACd0 circuits given a truth table

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 237-251

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

^a RUTGERS UNIVERSITY   (United States)

^b Polytechnic University   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN CIRCUITS; COMPLEX REDUCTIONS; COMPUTATIONAL PROBLEMS; QUASIPOLYNOMIAL TIME;

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

LOGIC CIRCUITS;

EID: 34247522421     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.27     Document Type: Conference Paper

References (43)

1. A. Aizenstein, T. Hegedus, L. Hellerstein, and L. Pitt, "Complexity theoretic hardness results for query learning", Computational Complexity 7(1), 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", ECCC TR05-126, 2005.
4. E. Allender, M. Koucky, D. Ronneberger, and S. Roy, "De- randomization 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, Illinois, USA, 2001, pp.295-302.
6. N. Alon, J. Spencer, and P. Erdös, The Probabilistic Method, John Wiley & Sons, 1992.
7. N. Alon, D. Moshkovitz, and S. Safra, "Algorithmic Construction of Sets for k-Restrictions", to appear in ACM Transactions on Algorithms.
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, California, 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", Journal of Computer and System Sciences 52(3), 1996, pp. 421-433.
10. N. H. Bshouty, "Simple learning algorithms using divide and conquer", Computational 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, 2002, pp. 287-302.
12. A. Chandra and G. Markowsky, "On the number of prime implicants", Discrete Mathematics 24, 1978, pp. 7-11.
13. V. Chvátal, "A greedy heuristic for the set covering problem", Mathematics of Operations Research 4, 1979, pp. 233-235.
14. O. Coudert, "Two-level logic minimization: an overview", Integration, the VLSI Journal 17(2), 1994, pp. 97-140.
15. Sabastian Czort, The complexity of minimizing disjunctive normal form formulas, Master's Thesis, University of Aarhus, 1999.
16. R. Downey and M. Fellows, Parameterized Complexity, Springer Verlag, 1999.
17. U. Feige, "A threshold of ln n for approximating set cover", Journal of the ACM 45(4), 1998, pp. 634-652.
18. V. Feldman, "Hardness of Approximate Two-level Logic Minimization and PAC Learning with Membership Queries", ECCC TR05-127, 2005. Extended version to appear in Proceedings of the 38th Annual ACM Symposium on the Theory of Computing, 2006.
19. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
20. L. Hellerstein and V. Raghavan, "Exact learning of DNF formulas using DNF hypothesis", Journal of Computer and System Sciences 70(4), 2005, pp. 435-470.
21. D. S. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing, 11:555-556, 1982.
22. D. S. Johnson, "Approximation algorithms for combinatorial problems", Journal of Computer and System Sciences 9, 1974, pp. 256-278.
23. V. Kabanets, "Easiness assumptions and hardness tests: Trading time for zero error", Journal of Computer and System Sciences 63(2), 2001, pp. 236-252.
24. V. Kabanets and J. L. Cai, "Circuit minimization problem", in Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, Portland, Oregon, USA, 2000, pp. 73-79.
25. M. Kearns and L. Valiant, "Cryptographic limitations on learning boolean formula and finite automata", Journal of the ACM 41(1), 1989, pp. 433-444.
26. S. Khot, Online lecture notes for Probabilistically Checkable Proofs and Hardness of Approximation, Lecture 3 (scribed by Deeparnab Chakrabarti), available at www.cc.gatech.edu/~khot/pcp-course.html.
27. 1 and EF", In Logic and Computational Complexity: International Workshop, LCC '94, volume 960 of Lecture Notes in Computer Science, Springer-Verlag, 1995, pp. 210-220.
28. E. Kushilevitz, "A simple algorithm for learning o(log n)-term DNF", Information Processing Letters 61(6), 1997, pp.289-292.
29. L. Lovász, "On the ratio of optimal integral and fractional covers", Discrete Mathematics 13, 1975, pp. 383-390.
30. C. Lund and M. Yannakakis, "On the hardness of approximating minimization problems", Journal of the ACM 41(5), 1994, pp. 960-981.
31. W. J. Masek, "Some NP-complete set covering problems", Unpublished Manuscript, 1979.
32. M. Naor and O. Reingold, "Number-theoretic constructions of efficient pseudorandom functions", In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach, Florida, USA, 1997, pp. 458-467.
33. V. A. Nepomnjaščiǐ, "Rudimentary predicates and Turing calculations" Math. Dokl 11, 1970, pp. 1462-1465.
34. K. Pillaipakkamnatt, and V. Raghavan, "On the Limits of Proper Learnability of Subclasses of DNF formulas", Machine Learning 25(2-3), 1996, pp. 237-263.
35. L. Pitt and L. G.Valiant, "Computational limitations on learning from examples", Journal of the ACM 35, 1988, pp. 965-984.
36. R. Raz, "A Parallel Repetition Theorem", SIAM Journal on Computing 27, 1998, pp. 763-803.
37. A. A. Razborov and S. Rudich, "Natural proofs", Journal of Computer and System Sciences 55(1), August 1997, pp. 24-35.
38. I. Dinur, E. Fischer, G. Kindler, R. Raz, S. Safra, PCP characterization of NP: Towards a Polynomially Small Error Probability, In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, 1999, pp. 29-40.
39. 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.
40. Larry J. Stockmeyer, "The polynomial-time hierarchy", Theoretical Computer Science 3, 1977, pp. 1-22.
41. C. Umans, "The minimum equivalent DNF problem and shortest implicants", In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, California, USA, 1998, pp. 556-563.
42. p minimization problems", In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York City, New York, USA, 1999, pp. 465-474.
43. C. Umans, "Complexity of Two-Level Logic Minimization", Technical Report No. UCB/ERL M04/45, Berkeley, CA, October 2004.