A new lower bound on the expected size of irredundant forms for Boolean functions

DOI10.1016/0020-0190(94)00211-GzbMath1022.68592MaRDI QIDQ673913

Luke O'Connor

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

combinatorial problemstheory of computationprime implicantsirredundant form

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of prime implicants
• On the size of PLAs required to realize binary and multiple-valued functions
• The Production of Completion Signals by Asynchronous, Iterative Networks
• The Problem of Simplifying Truth Functions

This page was built for publication: A new lower bound on the expected size of irredundant forms for Boolean functions