On the geometric separability of Boolean functions

Discrete Applied Mathematics

Volumn 66, Issue 3, 1996, Pages 205-218

  Hegedus, Tibor ^a   Megiddo, Nimrod ^b,c  

^a Physics and Informatics   (Slovakia)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042075424     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(94)00161-6     Document Type: Article

References (25)

1. H. Aizenstein, L. Hellerstein and L. Pitt, Read-thrice DNF is hard to learn with membership and equivalence queries, in: Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'92) (IEEE Computer Society Press, Silver Spring, MD, 1992) 523-532.
2. D. Angluin, Computational learning theory: survey and selected bibliography, in: Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC'92) (ACM Press, New York, 1992) 351-369.
3. J.L. Balcàzar, J. Diaz and J. Gabarrô, Structural Complexity I (Springer, Berlin, 1988).
4. V. Chvátal and P.L. Hammer, Aggregation of linear inequalities in integer programming, Ann. Discrete Math. 1 (1977) 145-162.
5. Y. Crama, Recognition problems for special classes of polynomials in 0-1 variables, Math. Programming 44 (1989) 139-155.
6. L.W. Danzer, B. Grünbaum and V. Klee, Helly's theorem and its relatives, in: Convexity, Proc of Symposia in Pure Mathematics, Vol. 7 (AMS, Providence, 1963) 101-180.
7. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
8. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
9. P.L. Hammer, T. Ibaraki and U.N. Peled, Threshold numbers and threshold completions, in: P. Hansen, ed., Studies on Graphs and Discrete Mathematics (North-Holland, Amsterdam, 1981) 125-145.
10. T. Hegedus, Computational limitations on PAC and on-line learning over the Boolean domain: a comparison, unpublished manuscript, 1992.
11. T. Hegedus, Can complexity theory benefit from learning theory?, in: Proceedings of the European Conference on Machine Learning (ECML-93), Vienna, 1993 (Lecture Notes in Computer Science, Vol. 667, Springer, Berlin, 1993) 354-359.
12. T. Hegedus, On training simple neural networks and small-weight neurons, in: J. Shawe-Taylor and M. Anthony, eds., Computational Learning Theory: EuroCOLT'93 (Clarendon Press, Oxford, 1994) 69-82.
13. E. Helly, Über Mengen konvexer Körper mit gemeinschaftlichen Punkten, Jahresbericht der Deutschen Mathematiker-Vereinigung 32 (1923) 175-176.
14. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier, Amsterdam, 1990), 67-161.
15. T.H. Ma, On the threshold dimension 2 graphs, Technical Report, Institute of Information Science, Academia Sinica, Nankang, Taipei, Republic of China, 1993.
16. W. Maass and Gy. Turán, On the complexity of learning from counterexamples, in: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS'89) (IEEE Computer Society Press, Los Angeles, 1989) 262-267.
17. W. Maass and Gy. Turán, How fast can a threshold gate learn?, Report 321, IIG-Report Series, Graz University of Technology, 1991.
18. S. Muroga, Threshold Logic (Wiley/Interscience, New York, 1971).
19. U.N. Peled and B. Simeone, Polynomial-time algorithms for regular set-covering and threshold synthesis, Discrete Appl. Math. 12 (1985) 57-69.
20. L. Pitt and L. Valiant, Computational limitations on learning from examples, J. ACM 35 (1988) 965-984.
21. L. Pitt and M.K. Warmuth, The minimum consistent DFA problem cannot be approximated within any polynomial, J. ACM 40(1) (1993) 95-142.
22. Gy. Turán, A survey of some aspects of computational learning theory, in: Proceedings of the 8th Conference Fundamentals of Computation Theory (FCT'91), Szeged, Hungary, 1991, Lecture Notes in Computer Science, Vol. 529 (Springer, Berlin, 1991) 89-103.
23. R.I. Tyshkevich and A.A. Chernyak, Threshold decompositions of Boolean functions and graphs, in: A.A. Markov, ed., Combinatorial-Algebraic and Probabilistic Methods of Discrete Analysis (Gorkii State University, 1989) 111-129 (in Russian).
24. C. Wang and A.C. Williams, The threshold order of a Boolean function, Discrete Appl. Math. 31 (1991) 51-69.
25. M. Yannakakis, The complexity of the partial order dimension problem, SIAM J. Algebraic Discrete Methods 3 (1982) 351-358.