On the minimization of (complete) ordered binary decision diagrams (Q503467)
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: On the minimization of (complete) ordered binary decision diagrams |
scientific article; zbMATH DE number 6674146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimization of (complete) ordered binary decision diagrams |
scientific article; zbMATH DE number 6674146 |
Statements
On the minimization of (complete) ordered binary decision diagrams (English)
0 references
12 January 2017
0 references
complexity theory
0 references
layout problems
0 references
nonuniform finite automata
0 references
NP-completeness
0 references
ordered binary decision diagrams
0 references
0 references
0.9379311800003052
0 references
0.8834035992622375
0 references
0.8753534555435181
0 references
0.8720262050628662
0 references
0.8662923574447632
0 references
