Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule

DOI10.1016/J.ADVENGSOFT.2011.02.009MaRDI QIDQ634260zbMATH OpenOpenAlexFDO

Authors Fatih Başçiftçi, Şirzat Kahramanli

Publication date 2 August 2011

Published in Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.advengsoft.2011.02.009

zbMATH Keywords

\texttt{ESPRESSO} algorithmBoolean functionsdirect-coverexact minimization algorithm (\texttt{EMA})logic operationsnumerical examplespartial ordering operationprime implicantstwo-level logic minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Recommendations

• Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
• scientific article; zbMATH DE number 856969
• A minimization method for boolean functions
• scientific article; zbMATH DE number 3894978
• Polynomial-time algorithms for generation of prime implicants

Cites work

• Finding a fault tolerant routing on neighbour-faulty hypercube
• scientific article; zbMATH DE number 3902554 (Why is no real title available?)
• The Problem of Simplifying Truth Functions
• Worst and best irredundant sum-of-products expressions

Cited in

(2)

• Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
• scientific article; zbMATH DE number 856969 (Why is no real title available?)

This page was built for publication: Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule

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