Regular ArticleThe Minimum Equivalent DNF Problem and Shortest Implicants
Under an Elsevier user license
open archive
Keywords
DNF minimization
logic synthesis
polynomial hierarchy
shortest implicant
limited non-determinism
computational complexity
hardness of approximation
Cited by (0)
- 1
Supported in part by NSF Grant CCR-9626361 and an NSF Graduate Research Fellowship
- f1
E-mail: [email protected]
Copyright © 2001 Elsevier Science (USA). All rights reserved.