The forbidden projections of unate functions (Q1364471): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Wai-Kai Chen / rank | |||
Property / reviewed by | |||
Property / reviewed by: Wai-Kai Chen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Learning read-once formulas with queries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3728007 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4234065 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4385525 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5606985 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Forbidden Minors of Binary Clutters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4385515 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:35, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The forbidden projections of unate functions |
scientific article |
Statements
The forbidden projections of unate functions (English)
0 references
24 February 1998
0 references
A projection of a Boolean function is formed by taking a subset of the input variables of the function and fixing each of them to either 0 or 1. The paper presents a characterization of the class of unate Boolean function by forbidden projections. Unateness is a generalization of monotonicity. A function is unate in \(x\) if it is either monotone or anti-monotone in \(x\). A Boolean is unate if it is unate in all its input variables. The problem is analogous to forbidden graph minors problem.
0 references
Boolean function
0 references
unate Boolean function
0 references
forbidden projections
0 references