A Generalization of Nelson's Algorithm for Obtaining Prime Implicants
House, R. W. ; Rado, T.
J. Symbolic Logic, Tome 30 (1965) no. 1, p. 8-12 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1965-03-14
Classification:  
@article{1183735037,
     author = {House, R. W. and Rado, T.},
     title = {A Generalization of Nelson's Algorithm for Obtaining Prime Implicants},
     journal = {J. Symbolic Logic},
     volume = {30},
     number = {1},
     year = {1965},
     pages = { 8-12},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183735037}
}

House, R. W.; Rado, T. A Generalization of Nelson's Algorithm for Obtaining Prime Implicants. J. Symbolic Logic, Tome 30 (1965) no. 1, pp.  8-12. http://gdmltest.u-ga.fr/item/1183735037/