A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams (Q4617985)
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 theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams |
scientific article; zbMATH DE number 7014571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams |
scientific article; zbMATH DE number 7014571 |
Statements
A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams (English)
0 references
7 February 2019
0 references
binary decision diagrams
0 references
Common Lisp
0 references
Boolean simplification
0 references
data structures
0 references
0 references
0.8180934190750122
0 references
0.8125662803649902
0 references
0.8103432655334473
0 references
