This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computer Experience on Partitioned List Algorithms
November 1970 (vol. 19 no. 11)
pp. 1099-1105
The main characteristics of some programs implementing a number of different versions of partitioned list algorithms are described, and the results of a systematic plan of experiments performed on these programs are reported. These programs concern the determination of all the prime implicants, a prime implicant covering, or an irredundant normal form of a Boolean function. The experiments performed on these programs concern mainly the computer time required, the number of prime implicants obtained, and their distribution in families. The results obtained from these tests demonstrate that relatively large Boolean functions, involving even some thousands of canonical clauses, can be very easily processed by present-day electronic computers.
Index Terms:
Boolean function, computer programs, computing times, covering, experimental results, incompletely specified, irrdundant normal forms, minimization, partitioned list, prime implicants.
Citation:
E. Morreale, M. Mennucci, "Computer Experience on Partitioned List Algorithms," IEEE Transactions on Computers, vol. 19, no. 11, pp. 1099-1105, Nov. 1970, doi:10.1109/T-C.1970.222840
Usage of this product signifies your acceptance of the Terms of Use.