The complexity of Boolean formula minimization (Q619911): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q29300594, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29300594 / rank | |||
Normal rank | |||
Revision as of 23:42, 6 February 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
