Name
Abstract | ||
|---|---|---|
Fourty years ago Quine noted that finding a procedure that computes a minimal sum products for a given propositional formula is very complex, even though propositional formulas are fairly simple. Since this early work, this problem, known as two-level logic minimization, has attracted much attention. It arises in several fields of computer science, e.g., in logic synthesis, reliability analysis, and automated reasoning. This paper exposes the classical approach for two-level logic minimization, and presents the recent developments that overcome the limitations of the procedures proposed in the past. We show that these new techniques yield a minimizer that is 10 up to 50 times faster than the previously best known ones, and that is able to handle more complex functions. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0167-9260(94)00007-7 | Integration |
Keywords | Field | DocType |
combinational set,set covering problem,binary decision diagram,two-level logic minimization,transposing function | Logic synthesis,Automated reasoning,Set cover problem,Computer science,Algorithm,Binary decision diagram,Electronic engineering,Theoretical computer science,Minimisation (psychology),Minification,Resolution (logic),Propositional formula | Journal |
Volume | Issue | ISSN |
17 | 2 | Integration, the VLSI Journal |
Citations | PageRank | References |
92 | 6.52 | 29 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olivier Coudert | 1 | 665 | 104.87 |