This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reduced Solutions of Boolean Equations
October 1970 (vol. 19 no. 10)
pp. 976-981
F.M. Brown, IEEE
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, Oct. 1970, doi:10.1109/T-C.1970.222806
Usage of this product signifies your acceptance of the Terms of Use.