Generating Essential Primes for a Boolean Function with Multiple-Valued Inputs

DOI10.1109/TC.1987.1676907MaRDI QIDQ3767260zbMATH OpenOpenAlexFDO

Authors

Publication date 1987

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1987.1676907

zbMATH Keywords

Boolean function with multiple-valued inputsessential prime implicantlogic minimizationtautology checkingunate function

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Boolean functions (06E30) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
• scientific article; zbMATH DE number 856969
• scientific article; zbMATH DE number 3894978
• Polynomial-time algorithms for generation of prime implicants
• A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function

Cited in

(3)

• Polynomial-time algorithms for generation of prime implicants
• Monotone Boolean functions capture their primes
• A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function

This page was built for publication: Generating Essential Primes for a Boolean Function with Multiple-Valued Inputs

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