Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs (Q4800256)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1890818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs |
scientific article; zbMATH DE number 1890818 |
Statements
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs (English)
0 references
15 July 2003
0 references
polynomial time algorithm
0 references
0 references
0.8882222771644592
0 references
0.8202438354492188
0 references
0.8191417455673218
0 references
