Symmetric and Threshold Boolean Functions Are Exhaustive (Q3041088): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:41, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Symmetric and Threshold Boolean Functions Are Exhaustive |
scientific article |
Statements
Symmetric and Threshold Boolean Functions Are Exhaustive (English)
0 references
1983
0 references
Boolean functions
0 references
decision tree
0 references
multiplexer tree
0 references
threshold function
0 references
worst-case testing cost
0 references
