Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs (Q4800256): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059066560 / rank | |||
Normal rank | |||
Revision as of 22:57, 19 March 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
