Minimal implicant and DNF representation

MaRDI QIDQ5435101zbMATH OpenFDO

Authors Xinning Cheng, Zhenyu Cheng

Publication date 14 January 2008

zbMATH Keywords

computational complexityDNF minimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• The minimum equivalent DNF problem and shortest implicants
• scientific article; zbMATH DE number 3887605
• Complexity of DNF minimization and isomorphism testing for monotone formulas
• CNF and DNF considered harmful for computing prime implicants/implicates
• scientific article; zbMATH DE number 3930904

Cited in

(2)

• Discovery Science
• Complexity of DNF minimization and isomorphism testing for monotone formulas

This page was built for publication: Minimal implicant and DNF representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5435101)