PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Morreale E. Partitioned list algorithms for prime implicant determination from canonical forms. In: IEEE Transactions on Electronic Computers, vol. EC-16 (5) pp. 611 - 620. IEEE, 1967.
 
 
Abstract
(English)
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 l) 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.
Subject Algorithms
Computation
Partitioned list
Prime implicants
Quine's method


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional