Boolean function minimization in the class of disjunctive normal forms
From MaRDI portal
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)
Cites work
- scientific article; zbMATH DE number 3887605 (Why is no real title available?)
- scientific article; zbMATH DE number 3168987 (Why is no real title available?)
- scientific article; zbMATH DE number 3863115 (Why is no real title available?)
- scientific article; zbMATH DE number 3863116 (Why is no real title available?)
- scientific article; zbMATH DE number 3863117 (Why is no real title available?)
- scientific article; zbMATH DE number 3811475 (Why is no real title available?)
- scientific article; zbMATH DE number 3811476 (Why is no real title available?)
- scientific article; zbMATH DE number 3817593 (Why is no real title available?)
- scientific article; zbMATH DE number 3827756 (Why is no real title available?)
- scientific article; zbMATH DE number 3916176 (Why is no real title available?)
- scientific article; zbMATH DE number 3183399 (Why is no real title available?)
- scientific article; zbMATH DE number 3183400 (Why is no real title available?)
- scientific article; zbMATH DE number 3689287 (Why is no real title available?)
- scientific article; zbMATH DE number 3735728 (Why is no real title available?)
- scientific article; zbMATH DE number 3760092 (Why is no real title available?)
- scientific article; zbMATH DE number 3485647 (Why is no real title available?)
- scientific article; zbMATH DE number 3451825 (Why is no real title available?)
- scientific article; zbMATH DE number 3430529 (Why is no real title available?)
- scientific article; zbMATH DE number 3430532 (Why is no real title available?)
- scientific article; zbMATH DE number 3251101 (Why is no real title available?)
- scientific article; zbMATH DE number 3330443 (Why is no real title available?)
- scientific article; zbMATH DE number 3372009 (Why is no real title available?)
- scientific article; zbMATH DE number 3373722 (Why is no real title available?)
- scientific article; zbMATH DE number 3388935 (Why is no real title available?)
- scientific article; zbMATH DE number 3190323 (Why is no real title available?)
- scientific article; zbMATH DE number 3029852 (Why is no real title available?)
- A Method for Generating Prime Implicants of a Boolean Expression
- A Method for the Fast Approximate Solution of Large Prime Implicant Charts
- A Way to Simplify Truth Functions
- An Essay on Prime Implicant Tables
- Asymptotically good coverings
- Average Values of Quantities Appearing in Boolean Function Minimization
- Average Values of Quantities Appearing in Multiple Output Boolean Minimization
- Correction to "Minimization of Switching Circuits Subject to Reliability Conditions"
- Fault Detection in Redundant Circuits
- Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
- Maxterm Type Expressions of Switching Functions and Their Prime Implicants
- Numerical Procedures for Boolean Function Minimization
- On Cores and Prime Implicants of Truth Functions
- On the Theory of Boolean Formulas: Minimal Including Sums, I
- On the number of prime implicants
- Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms
- Recursive Operators for Prime Implicant and Irredundant Normal Form Determination
- Simplest normal truth functions
- Some Methods for Simplifying Switching Circuits Using “Don't Care” Conditions
- Statistical Complexity of Algorithms for Boolean Function Minimization
- THE ABSTRACT THEORY OF AUTOMATA
- The Problem of Simplifying Truth Functions
- The problem of simplifying logical expressions
Cited in
(9)- Properties of Boolean functions with the extremal number of prime implicants
- Connected Boolean functions with a locally extremal number of prime implicants
- scientific article; zbMATH DE number 3954820 (Why is no real title available?)
- scientific article; zbMATH DE number 4043810 (Why is no real title available?)
- Boolean Minimization of Projected Sums of Products via Boolean Relations
- Minimizing Disjunctive Normal Form Formulas and AC^0 Circuits Given a Truth Table
- Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms
- On irredundant complexes of faces in the unit cube
- OBDD minimization based on two-level representation of Boolean functions
This page was built for publication: Boolean function minimization in the class of disjunctive normal forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825217)
