The complexity of Boolean formula minimization (Q619911): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Minimization Problem for Boolean Formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circuit minimization problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4298260 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The polynomial-time hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The minimum equivalent DNF problem and shortest implicants / rank | |||
Normal rank |
Latest revision as of 16:48, 3 July 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
0 references