A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions (Q1225604)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions |
scientific article; zbMATH DE number 3510260
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions |
scientific article; zbMATH DE number 3510260 |
Statements
A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions (English)
0 references
1975
0 references
