The complexity of Boolean formula minimization (Q619911): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 09:15, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of Boolean formula minimization |
scientific article |
Statements
The complexity of Boolean formula minimization (English)
0 references
18 January 2011
0 references
formula minimization
0 references
computational complexity
0 references
logic synthesis
0 references
polynomial-time hierarchy
0 references
Turing reduction
0 references