Boolean function minimization in the class of disjunctive normal forms

DOI10.1007/BF01096022zbMath0684.06012MaRDI QIDQ1825217

I. P. Chukhrov, Alexander A. Sapozhenko

Publication date: 1989

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

bibliographydisjunctive normal formsminimization algorithmsminimization of Boolean functions

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Boolean functions (06E30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02)

Related Items (4)

Connected Boolean functions with a locally extremal number of prime implicants ⋮ On irredundant complexes of faces in the unit cube ⋮ Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms ⋮ Properties of Boolean functions with the extremal number of prime implicants

Cites Work

• Asymptotically good coverings
• On the number of prime implicants
• Simplest normal truth functions
• A Way to Simplify Truth Functions
• Some Methods for Simplifying Switching Circuits Using “Don't Care” Conditions
• THE ABSTRACT THEORY OF AUTOMATA
• An Essay on Prime Implicant Tables
• A Method for Generating Prime Implicants of a Boolean Expression
• Numerical Procedures for Boolean Function Minimization
• Statistical Complexity of Algorithms for Boolean Function Minimization
• Maxterm Type Expressions of Switching Functions and Their Prime Implicants
• Fault Detection in Redundant Circuits
• Average Values of Quantities Appearing in Multiple Output Boolean Minimization
• Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms
• A Method for the Fast Approximate Solution of Large Prime Implicant Charts
• Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
• On Cores and Prime Implicants of Truth Functions
• The problem of simplifying logical expressions
• Recursive Operators for Prime Implicant and Irredundant Normal Form Determination
• On the Theory of Boolean Formulas: Minimal Including Sums, I
• Correction to "Minimization of Switching Circuits Subject to Reliability Conditions"
• Average Values of Quantities Appearing in Boolean Function Minimization
• The Problem of Simplifying Truth Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Boolean function minimization in the class of disjunctive normal forms