Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms
- 1 October 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-16 (5) , 611-620
- https://doi.org/10.1109/pgec.1967.264768
Abstract
The structure of the algorithms implementing Quine's method for prime implicant determination is analyzed, and a new class of algorithms-partitioned list algorithms-for Quine's method is derived. Such algorithms are of particular interest for actual computation because they permit 1) avoiding repetitions while generating clauses, 2) representing each clause by only one binary configuration, 3) reducing memory capacity requirements, and 4) applying the basic operations by means of nonexhaustive techniques.Keywords
This publication has 4 references indexed in Scilit:
- Computer Design of Multiple-Output Logical NetworksIEEE Transactions on Electronic Computers, 1961
- The minimality of rectifier nets with multiple outputs incompletely specifiedJournal of the Franklin Institute, 1957
- Minimization of Boolean Functions*Bell System Technical Journal, 1956
- The Problem of Simplifying Truth FunctionsThe American Mathematical Monthly, 1952