Skip to search formSkip to main contentSkip to account menu

Circuit minimization for Boolean functions

Known as: Circuit minimization, Logic circuit minimization, Boolean minimization 
In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that represents a given Boolean… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
AND gateBinary decision diagramCircuit underutilizationElectronic circuit

Broader (3)

Boolean algebraCircuit complexityLogic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State
Age of information (AoI) is a recently proposed metric that measures the time elapsed since the generation of the last received… 
Highly Cited
2008
Highly Cited
2008
Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table
For circuit classes $R$, the fundamental computational problem Min-R asks for the minimum $R$-size of a Boolean function… 
Highly Cited
2008
Highly Cited
2008
Optimal complexity reduction of polyhedral piecewise affine systems
Highly Cited
1991
Highly Cited
1991
On variable ordering of binary decision diagrams for the application of multi-level logic synthesis
Develops multi-level logic minimization programs using binary decision diagram (BDD). The authors present variable ordering… 
Highly Cited
1990
Highly Cited
1990
Retiming and resynthesis: optimizing sequential networks with combinational techniques
A technique is proposed for optimizing a sequential network by moving the registers to the boundary of the network using an… 
Highly Cited
1989
Highly Cited
1989
NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations
The problem of encoding the states of a synchronous Finite State Machine (FSM), so that the area of a two-level implementation of… 
Highly Cited
1989
Highly Cited
1989
On the Relationship Between Circumscription and Negation as Failure
Highly Cited
1987
Highly Cited
1987
A Minimizing Algorithm for Sum of Disjoint Products
This paper describes a minimizing version of the Abraham sum-of-disjoint products (sdp) algorithm, called the Abraham-Locks… 
Highly Cited
1985
Highly Cited
1985
Optimal State Assignment for Finite State Machines
Computer-Aided synthesis of sequential functions of VLSI systems, such as microprocessor control units, must include design… 
Highly Cited
1984
Highly Cited
1984
Cascode voltage switch logic: A differential CMOS logic family
A differential CMOS Logic family that is well suited to automated logic minimization and placement and routing techniques, yet… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)