A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions (Q1225604): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00289614 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063412216 / rank | |||
Normal rank | |||
Latest revision as of 09:52, 30 July 2024
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
