Two-level logic minimization: an overview

DOI10.1016/0167-9260(94)00007-7zbMATH Open0818.94025OpenAlexW2082448265MaRDI QIDQ4325354FDOQ4325354

Authors: 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

Recommendations

• Publication:4886040
• scientific article; zbMATH DE number 3902554
• Publication:3035136
• SAT-Based Formula Simplification
• Synthesis of multilevel Boolean networks

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (26)

• SAT-Based Formula Simplification
• A purely map procedure for two-level multiple-output logic minimization
• Title not available (Why is that?)
• The ghosts of forgotten things: a study on size after forgetting
• Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions
• Title not available (Why is that?)
• Algorithms for computing minimal equivalent subformulas
• Two-Level Multiple-Output Logic Minimization Using A Single Function
• Ordered binary decision diagrams and the Shannon effect
• Title not available (Why is that?)
• Synthesis of autosymmetric functions in a new three-level form
• Title not available (Why is that?)
• The minimum equivalent DNF problem and shortest implicants
• Title not available (Why is that?)
• Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares
• Synthesis of multilevel Boolean networks
• McColl and minimization
• Signal Transition Graphs for Asynchronous Data Path Circuits
• Efficient implementation of regular languages using reversed alternating finite automata
• Logic minimization techniques with applications to cryptology
• Title not available (Why is that?)
• Resolution cannot polynomially simulate compressed-BFS
• Common equivalence and size of forgetting from Horn formulae
• The Complexity of SPP Formula Minimization
• Derivation of Minimal Sums for Completely Specified Functions
• Implementing automata. Selected papers from the 2nd international workshop, WIA '97, Univ. of Western Ontario, London, Ontario, Canada, September 18--20, 1997

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4325354)