Simplification of the Covering Problem with Application to Boolean Expressions
- 1 January 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 17 (1) , 166-181
- https://doi.org/10.1145/321556.321572
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- Combinatorial equivalence of (0, 1) circulant matricesJournal of Computer and System Sciences, 1969
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- Integer Programming: Methods, Uses, ComputationsManagement Science, 1965
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- An Essay on Prime Implicant TablesJournal of the Society for Industrial and Applied Mathematics, 1961
- An application of linear programming to the minimization of Boolean functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1961
- On Cores and Prime Implicants of Truth FunctionsThe American Mathematical Monthly, 1959