Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs (Q4800256): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:46, 8 February 2024
scientific article; zbMATH DE number 1890818
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
