IEEE Transactions on Electronic Computers · 1967 · 24 citations · 5 references
ComputingComputer ScienceAlgorithmsCompilersData StructuresData Structure AlgorithmsNumber-theoretic AlgorithmsMemory CapacityMemory Storage Capacity
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.
5
Minimization of Boolean Functions*
E.J. McCluskey · Bell System Technical Journal · 1956 · 1.2K citations
The Problem of Simplifying Truth Functions
W. V. Quine · American Mathematical Monthly · 1952 · 801 citations
The Problem of Simplifying Truth Functions
W. V. Quine · American Mathematical Monthly · 1952 · 434 citations