The minimum equivalent DNF problem and shortest implicants

Journal of Computer and System Sciences

Volumn 63, Issue 4, 2001, Pages 597-611

  Umans, Christopher ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Computational complexity; DNF minimization; Hardness of approximation; Limited non determinism; Logic synthesis; Polynomial hierarchy; Shortest implicant

Indexed keywords

APPROXIMATION THEORY; BOOLEAN FUNCTIONS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

LOGIC SYNTHESIS; POLYNOMIAL HIERARCHY; SHORTEST IMPLICANTS;

COMPUTATIONAL COMPLEXITY;

EID: 0035734260     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1775     Document Type: Article

References (18)

1. p-complete
2. On the computational complexity of some classical equivalence relations on Boolean functions
3. On the amount of nondeterminism and the power of verifying
4. Two-level logic minimization: An overview
5. Logic synthesis
6. Classes of bounded nondeterminism
7. A method of producing a boolean function having an arbitrarily prescribed prime implicant table
8. The minimization problem for Boolean formulas
9. Refining nondeterminism in relativized polynomial-time bounded computations
10. Minimization of Boolean functions
11. On limited nondeterminism and the complexity of the V-C dimension
12. The problem of simplifying truth functions
13. Graph Ramsey theory and the polynomial hierarchy
14. The polynomial-time hierarchy
15. Polynomial-time algorithms for generation of prime implicants
16. P minimization problems
17. More complicated quenstions about maxima and minima, and some closures of NP
18. The complexity of Boolean functions