On finding optimal covers

Bibliography

• Dunham , B. and Fridshal , R. 1958 . The problem of simplifying logical expressions . J. of Symbolic Logic , 24 : 17 – 19 .
   Google Scholar
• Gimpel , J.F. 1965 . A reduction technique for prime implicant tables . I E E Transactions on Electronic Computers EC , 14 : 535 – 541 .
   Google Scholar
• McCluskey , E.J. Jr. 1956 . Minimization of Boolean functions . Bells System Technical J. , 35 : 1417 – 1444 .
   Google Scholar
• McCluskey , E.J. Jr. 1962 . Minimum-state sequential circuits for a restricted class of incompletely specified flow tables . Bell System Technical J , 41 : 1759 – 1768 .
   Google Scholar
• McCluskey , E.J. Jr. 1962 . “ Essential multiple output prime implicants ” . In Mathematical theory of automata Edited by: Fox , J. 437 – 457 .
   Google Scholar
• Mayoh , B.H. 1962 . Algorithms 81, 82, 83 . Communications of the Association for Computer Machinery , 5 : 166 – 168 .
   Google Scholar
• Mayoh , B.H. 1967 . On the simplification of logical expressions . J. of Society for Industrial and Applied Mathematics , 5 : 898 – 905 . to appear in
   Google Scholar
• Mott , T.H. and Petrick , S.R. 1959 . Abstracts in Information processing , 422 UNESCO .
   Google Scholar
• Narasimhan , R. 1964 . Labelling schemata and syntactic description of pictures . Information and Control , 6 : 131 – 157 .
   Google Scholar
• Nelson , R.J. 1954 . Simplest normal truth functions . J. of Symbolic Logic , 20 : 105 – 107 .
   Google Scholar
• Petrick , S.R. 1956 . A direct determination of the irredundant forms of a Boolean function from the set of prime implicants , Cambridge : Air Force Cambridge Research Center . AFCRC-TR-56-110
   Google Scholar
• Quine , W.V. 1954 . The problem of simplifying truth functions . American Mathematical Monthly , 59 : 521 – 531 .
   Google Scholar
• Quine , W.V. 1955 . A way to simplify truth functions . American Mathematical Monthly , 62 : 621 – 631 .
   Google Scholar
• Roth , J.P. Algebraic topological methods in synthesis . Proc. International Symposium on the Theory of Switching . Cambridge : Harvard Uaiv. .
   Google Scholar
• Rüdigerova , Marie . 1965 . Minimization of Boolean functions . Aplikace Matematiky , 10 : 49 – 58 .
   Google Scholar
• Svoboda , A. 1958 . Some applications of contact grids . Stroje na zpracovani informaci , 6 : 1 – 13 .
   Google Scholar
• Weinmiller , J. 1961 . Hilfsmittel zur Vereinfachung von Schaltfunktionen . Elektronische Rechenanlagen , 3 : 123 – 129 .
   Google Scholar
• Wells , M.B. 1962 . “ Application of a finite set covering theorem to the simplification of boolean function expressions ” . In Information Processing 62 , Edited by: Popplewell , C. 731 – 734 . Amsterdam : N. Holland .
   Google Scholar
• Quine , W.V. 1959 . On cores and prime implicants of truth functions . American Mathe-matical Monthly , 66 : 755 – 760 .
   Google Scholar
• Petrick , S.R. 1966 . On the minimal covering problem , Cambridge : Air Force Cam-bridge Research Center . Preprint from
   Google Scholar
• Petrick , S.R. On the use of Boolean functions in pattern recognition . IRE Int. Symposium on Information Theory . Brussels
   Google Scholar
• Petrick , S.R. 1963 . “ Minimization procedures in phonology ” . In Air Force Cambridge Research Laboratory Cambridge A F C R C.-63-324
   Google Scholar
• Weissman , J. 1962 . Boolean algebra, map colouring, and interconnections . American Mathematical Monthly , 69 : 608 – 613 .
   Google Scholar
• Gazale , M.T. 1957 . Irredundant disjunctive and conjunctive forms of a Boolean function . I B M J. of Research and Developement , 1 : 171 – 176 .
   Web of Science ®Google Scholar
• Chang , D.M. and Mott , T.H. Computing irredundant forms from abbreviated presence functions . Proceedings of the IFIP congress . Munich .
   Google Scholar
• Mott , T.H. 1960 . “ Determination of the irredundant normal forms of a truth function by iterated concensus of the prime implicants ” . In IRE Transactions on Electronic Computers EC-9 245
   Google Scholar
• Pyne , I.B. and McCluskey , E.T. 1961 . An essay on prime implicant tables . J. of Society for Industrial and Applied Mathematics , 9 : 604 – 631 .
   Google Scholar