A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions (Q1225604)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions |
scientific article |
Statements
A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions (English)
0 references
1975
0 references
