Hardness of approximate two-level logic minimization and PAC learning with membership queries

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 363-372

  Feldman, Vitaly ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

DNF minimization; Hardness of approximation; Membership queries; Proper learning; Truth table; Two level logic minimization; Uniform distribution

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DECISION TABLES; POLYNOMIALS; PROBLEM SOLVING;

DNF MINIMIZATION; HARDNESS OF APPROXIMATION; MEMBERSHIP QUERIES; PROPER LEARNING; TRUTH TABLE; TWO-LEVEL LOGIC MINIMIZATION; UNIFORM DISTRIBUTION;

LOGIC CIRCUITS;

EID: 33748122867     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132569     Document Type: Conference Paper

References (41)

1. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data. Data Mining and Knowledge Discovery, 11(1):5-33, July 2005.
2. M. Alekhnovich, M. Braverman, V. Feldman, A. Klivans, and T. Pitassi. Learnability and automizability. In Proceeding of FOCS '04, pages 621-630, 2004.
3. 0 Circuits Given a Truth Table. Electronic Colloquium on Computational Complexity (ECCC), (126), Nov, 2005.
4. E. Allender, L. Hellerstein, T. Pitassi, and M.Saks. On the complexity of finding minimal representations of boolean functions. 2004. Unpublished.
5. D. Angluin and M. Kharitonov. When won't membership queries help? Journal of Computer and System Sciences, 50(2):336-355, 1995.
6. M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximations. In STOC '93, pages 294-304, 1993.
7. A. Blum and S. Rudich. Fast learning of k-term DNF formulas with queries. Journal of Computer and System Sciences, 51(3):367-373, 1995.
8. A. L. Blum and R. L. Rivest. Training a 3-node neural network is NP-complete. Neural Networks, 5(1):117-127, 1992.
9. O. Coudert and J. Madre. METAPRIME, an Interactive Fault-Tree Analyser. IEEE Transactions on Reliability, 43(1):121-127, 1994.
10. O. Coudert and T. Sasao. Two-level logic minimization. Kluwer Academic Publishers, 2001.
11. S. Czort. The complexity of minimizing disjunctive normal form formulas. Master's thesis, University of Aarhus, 1999.
12. I. Dinur, V. Guruswami, S. Khot, and O. Regev. A new multilayered pep and the hardness of hypergraph vertex cover. SIAM Journal of Computing, 34(5):1129-1146, 2005.
13. P. Erdös, P. Frankl, and Z. Furedi. Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51:79-89, 1985.
14. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
15. U. Feige and J. Kilian. Zero knowledge and the chromatic number. In Proceedings of Conference on Computational Complexity (CCC-96), pages 278-289, May 24-27 1996.
16. J.F. Gimpel. A method for producing a boolean function having an arbitrary prescribed prime implicant table. IEEE Transactions on Computers, 14:485-488, 1965.
17. E. A. Gold. Complexity of automaton identification from given data. Information and Control, 37:302-320, 1978.
18. Johan Håstad and Subhash Khot. Query Efficient PCPs with Perfect Completeness. Theory of Computing, 1(7):119-148, 2005.
19. Lisa Hellerstein and Vijay Raghavan. Exact learning of DNF formulas using DNF hypotheses. In ACM, editor, Proceedings of STOC '02, pages 465-473, 2002.
20. J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 55:414-440, 1997.
21. W. Kautz and R. Singleton. Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory, 10:363-377, 1964.
22. M. Kearns, M. Li, L. Pitt, and L. Valiant. On the learnability of boolean formulae. In Proceedings of the Nineteenth Annual Symposium on Theory of Computing, pages 285-295, 1987.
23. 1/3). In Proceedings of the Thirty-Third Annual Symposium on Theory of Computing, pages 258-265, 2001.
24. H. Liu. Routing table compaction in ternary cam. IEEE Micro, 22(1):58-64, 2002.
25. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41(5):960-981, 1994.
26. W. Masek. Some NP-complete set covering problems. unpublished, 1979.
27. E. L. Jr. McCluskey. Minimization of Boolean Functions. Bell Sys. Tech. Jour., 35:1417-1444, 1956.
28. N. Nisan and A. Wigderson. Hardness versus randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
29. R. Nock, P. Jappy, and J. Sallantin. Generalized graph colorability and compressibility of boolean formulae. In Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC), 1998.
30. W. J. Paul. Boolesche minimalpolynome und überdeckungsprobleme. Acta Informatica, 4:321-336, 1974.
31. L. Pitt and L. Valiant. Computational limitations on learning from examples. Journal of the ACM, 35 (4):965-984, 1988.
32. W.V. Quine. The problem of simplifying truth functions. Americal Mathematical Monthly, 59:521-531, 1952.
33. W.V. Quine. A way to simplify truth functions. Americal Mathematical Monthly, 62:627-631, 1956.
34. R. Raz and S. Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of STOC '97, pages 475-484, 1997.
35. A. Ta-Shma. A Note on PCP vs. MIP. Information Processing Letters, 58(3):135-140, 1996.
36. L. Trevisan. Non-approximability results for optimization problems on bounded degree instances. In Proceedings of STOC '01, pages 453-461, 2001.
37. C. Umans. The minimum equivalent DNF problem and shortest implicants. J. Comput. Syst. Sci., 63(4):597-611, 2001.
38. C. Umans, T. Villa, and A. L. Sangiovanni-Vincentelli. Complexity of two-level logic minimization. Technical Report UCB/ERL M04/45, UC Berkeley, October 2004.
39. S. Vadhan. Lecture notes on pseudorandomness. Available at http://www.courses.fas.harvard.edu/~cs225/, 2004.
40. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
41. L. Valiant. Learning disjunctions of conjunctions. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 560-566, 1985.