|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
On the Determination of Complete Sets of Logical Functions
March 1968 (vol. 17 no. 3)
pp. 273
| ASCII Text | x | ||
| S.R. Petrick, G.C. Sethares, "On the Determination of Complete Sets of Logical Functions," IEEE Transactions on Computers, vol. 17, no. 3, pp. 273, March, 1968. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1968.229101, author = {S.R. Petrick and G.C. Sethares}, title = {On the Determination of Complete Sets of Logical Functions}, journal ={IEEE Transactions on Computers}, volume = {17}, number = {3}, issn = {0018-9340}, year = {1968}, pages = {273}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1968.229101}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On the Determination of Complete Sets of Logical Functions IS - 3 SN - 0018-9340 SP EP EPD - 273 A1 - S.R. Petrick, A1 - G.C. Sethares, PY - 1968 KW - Index terms?Complete sets KW - irredundant coverings KW - logical functions KW - minimal coverings KW - programming. VL - 17 JA - IEEE Transactions on Computers ER - | |||
Abstract?A procedure is described, based on a theorem of Post, for determining the nonredundant complete sets of logical functions. Kudielka and Oliva's determination of these functions for two and three variables was verified by means of this procedure in less than a minute of computer time. The procedure requires the computation of irredundant coverings, and novel features of the algorithm which was used to carry out this computation are also described.
Index Terms:
Index terms?Complete sets, irredundant coverings, logical functions, minimal coverings, programming.
Citation:
S.R. Petrick, G.C. Sethares, "On the Determination of Complete Sets of Logical Functions," IEEE Transactions on Computers, vol. 17, no. 3, pp. 273, March 1968, doi:10.1109/TC.1968.229101
Usage of this product signifies your acceptance of the Terms of Use.