The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1970 vol.19)
pp: 976-981
F.M. Brown , IEEE
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.
INDEX TERMS
Boolean algebra, Boolean equations, Boolean matrices, Boolean parameters, logical equations.
CITATION
F.M. Brown, "Reduced Solutions of Boolean Equations", IEEE Transactions on Computers, vol.19, no. 10, pp. 976-981, October 1970, doi:10.1109/T-C.1970.222806
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool