|
| 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
| ASCII Text | x | ||
| 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. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1972.5009018, author = {Terry L. Dollhoff and Bernard L. Weinberg}, title = {A Result on Set Extraction and Application to Covering-Closure Tables}, journal ={IEEE Transactions on Computers}, volume = {21}, number = {6}, issn = {0018-9340}, year = {1972}, pages = {603-606}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1972.5009018}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Result on Set Extraction and Application to Covering-Closure Tables IS - 6 SN - 0018-9340 SP603 EP606 EPD - 603-606 A1 - Terry L. Dollhoff, A1 - Bernard L. Weinberg, PY - 1972 VL - 21 JA - IEEE Transactions on Computers ER - | |||
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.