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

DOI10.1109/TC.1987.1676907zbMath0629.94020OpenAlexW1976016558MaRDI QIDQ3767260

No author found.

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

logic minimizationunate functionBoolean function with multiple-valued inputsessential prime implicanttautology checking

Mathematics Subject Classification ID

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

Related Items (1)

Polynomial-time algorithms for generation of prime implicants

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