# Optimal Two-Level Boolean Minimization

```@inproceedings{Dick2016OptimalTB,
title={Optimal Two-Level Boolean Minimization},
author={Robert P. Dick},
booktitle={Encyclopedia of Algorithms},
year={2016}
}```
• R. Dick
• Published in Encyclopedia of Algorithms 2016
• Computer Science
Find a minimal sum-of-products expression for a Boolean function. Consider a Boolean algebra with elements False and True. A Boolean function f .y1; y2; : : : ; yn/ of n Boolean input variables specifies, for each combination of input variable values, the function’s value. It is possible to represent the same function with various expressions. For example, the first and last expressions in Fig. 1 correspond to the same function. Assuming access to complemented input variables, straightforward…

## References

SHOWING 1-10 OF 10 REFERENCES
Complexity of two-level logic minimization
• Computer Science
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
• 2006
This paper surveys progress in the field with self-contained expositions of fundamental early results, an account of the recent advances, and some new classifications, as well as a discussion of the major remaining open problems in the complexity of logic minimization.
Minimization of Boolean functions
A systematic procedure is presented for writing a Boolean function as a minimum sum of products and specific attention is given to terms which can be included in the function solely for the designer's convenience.
Reducibility Among Combinatorial Problems
• R. Karp
• Computer Science
50 Years of Integer Programming
• 1972
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
Multilevel logic synthesis
• Computer Science
• 1990
A survey of logic synthesis techniques for multilevel combinational logic is presented. The goal is to provide more in-depth background and perspective for people interested in pursuing or assessing
The map method for synthesis of combinational logic circuits
• M. Karnaugh
• Computer Science
Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics
• 1953
The problem in this area which has been attacked most energetically is that of the synthesis of efficient combinational that is, nonsequential, logic circuits.
New Ideas for Solving Covering Problems
• Computer Science
32nd Design Automation Conference
• 1995
A better lower bound computation algorithm and two new pruning techniques that significantly improve the efficiency of covering problem solvers are presented.
A Reduction Technique for Prime Implicant Tables
This paper presents a new reduction technique which is operable on any otherwise irreducible table having a column covered by exactly two rows, and it is shown that this technique is applicable to prime implicant tables.
The Problem of Simplifying Truth Functions
The Problem of Simplifying Truth Functions is concerned with the problem of reducing the number of operations on a graph to a simple number.
Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations
• 1972