Reduced Solutions of Boolean Equations
- 1 October 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-19 (10) , 976-981
- https://doi.org/10.1109/t-c.1970.222806
Abstract
The family of solutions for a Boolean equation is commonly represented in a single formula involving arbitrary Boolean parameters. It is well known that n parameters suffice to construct a general solution for an equation in n unknowns. For some equations, however, a general solution may be constructed using fewer than n parameters. This paper describes a method for constructing reduced solutions, i.e., general solutions involving the fewest parameters possible.Keywords
This publication has 6 references indexed in Scilit:
- An Investigation of the Laws of ThoughtPublished by Cambridge University Press (CUP) ,2009
- Boole’s Method for Solving Boolean EquationsThe Mathematical Gazette, 1966
- An Algorithm for Solving Boolean EquationsIEEE Transactions on Electronic Computers, 1963
- A note on Boolean matrix theoryProceedings of the American Mathematical Society, 1952
- The Synthesis of Two-Terminal Switching CircuitsBell System Technical Journal, 1949
- Memoir on the Algebra of Symbolic LogicAmerican Journal of Mathematics, 1901