This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Result on Set Extraction and Application to Covering-Closure Tables
June 1972 (vol. 21 no. 6)
pp. 603-606
Terry L. Dollhoff, Naval Ship Engineering Center, Prince George's Center, Hyattsville, Md. 20782.
Bernard L. Weinberg, Department of Computer Science, Michigan State University, East Lansing, Mich. 48823.
A general result on Boolean set extraction is obtained. By partitioning Boolean cubes into two sets as they are generated, both computational effort of redundant cube elimination and memory requirements are reduced. The extraction procedure is computer implemented and applied to the exact solution of covering-closure tables for any given cost criterion.
Citation:
Terry L. Dollhoff, Bernard L. Weinberg, "A Result on Set Extraction and Application to Covering-Closure Tables," IEEE Transactions on Computers, vol. 21, no. 6, pp. 603-606, June 1972, doi:10.1109/TC.1972.5009018
Usage of this product signifies your acceptance of the Terms of Use.