Two-level logic minimization: an overview

DOI10.1016/0167-9260(94)00007-7zbMath0818.94025OpenAlexW2082448265MaRDI QIDQ4325354

Olivier Coudert

Publication date: 20 August 1995

Published in: Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9260(94)00007-7

zbMATH Keywords

set covering problembinary decision diagramtwo-level logic minimizationlogic minimizationpropositional formulacombinational set

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Classical propositional logic (03B05)

Related Items (10)

Ordered binary decision diagrams and the Shannon effect ⋮ SAT-Based Formula Simplification ⋮ Signal Transition Graphs for Asynchronous Data Path Circuits ⋮ Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares ⋮ Algorithms for computing minimal equivalent subformulas ⋮ Synthesis of autosymmetric functions in a new three-level form ⋮ Resolution cannot polynomially simulate compressed-BFS ⋮ Efficient implementation of regular languages using reversed alternating finite automata ⋮ Implementing automata. Selected papers from the 2nd international workshop, WIA '97, Univ. of Western Ontario, London, Ontario, Canada, September 18--20, 1997 ⋮ The minimum equivalent DNF problem and shortest implicants

This page was built for publication: Two-level logic minimization: an overview