The forbidden projections of unate functions

Discrete Applied Mathematics

Volumn 77, Issue 3, 1997, Pages 221-236

  Feigelson, Aaron ^a   Hellerstein, Lisa ^a  

^a Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 16344385002     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00136-9     Document Type: Article

References (9)

1. D. Angluin, L. Hellerstein and M. Karpinski, Learning read-once formulas with queries, J. ACM 42 (1993) 185-210.
2. T. Brylawski, Constructions, in: N. White, Ed., Theory of Matroids (Cambridge Univ. Press, Cambridge, 1986) 127-223.
3. N. Bshouty, Exact learning via the monotone theory, Proceedings of the 34th Annual IEEE Symposium on the Foundations of Computer Science (1993) 302-311.
4. L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan and D. Wilkins, How many queries are needed to learn? Proceedings of the 27th Annual ACM Symposium on Theory of Computing (1995) 190-199.
5. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen, Ed., Handbook of Theoretical Computer Science, Vol. A (MIT Press, Cambridge, MA, 1990) 67-161.
6. Z. Kohavi, Switching and Finite Automata Theory (McGraw-Hill, New York, 1978).
7. R. McNaughton, Unate truth functions, IRE Trans. Electron. Comput. 10(1) (1961) 1-6.
8. P.D. Seymour, The forbidden minors of binary clutters, J. London Math. Soc. (2) 12 (1976) 356-360.
9. J. van Leeuwen, Graph algorithms, in: J. van Leeuwen, Ed., Handbook of Theoretical Computer Science, Vol. A (MIT Press, Cambridge, MA, 1990) 525-631.