The Forbidden Projections of Unate Functions

Abstract We characterize the forbidden projections of unate Boolean functions. Forbidden projections are analogous to forbidden graph minors. Unate functions have been studied in switching theory and in computational learning theory.

[1]  Lisa Hellerstein,et al.  How many queries are needed to learn? , 1995, JACM.

[2]  Robert McNaughton,et al.  Unate Truth Functions , 1961, IRE Trans. Electron. Comput..

[3]  P. Tichý.  Constructions , 1986, Philosophy of Science.

[4]  Nader H. Bshouty,et al.  Exact learning via the Monotone theory , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[5]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[6]  Paul Seymour,et al.  The Forbidden Minors of Binary Clutters , 1976 .

[7]  Carl A. Gunter,et al.  In handbook of theoretical computer science , 1990 .

[8]  Jan van Leeuwen,et al.  Graph Algorithms , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[9]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[10]  Marek Karpinski,et al.  Learning read-once formulas with queries , 1993, JACM.