An improved hierarchy result for partitioned BDDs (Q1587372)
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: An improved hierarchy result for partitioned BDDs |
scientific article; zbMATH DE number 1533097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved hierarchy result for partitioned BDDs |
scientific article; zbMATH DE number 1533097 |
Statements
An improved hierarchy result for partitioned BDDs (English)
0 references
7 December 2000
0 references
complexity of Boolean function
0 references
partitioned binary decision diagrams
0 references
0.8446035981178284
0 references
0.8026198744773865
0 references
0.8013725280761719
0 references
0.776483416557312
0 references
