Reduced Solutions of Boolean Equations
暂无分享,去创建一个
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.
[1] Claude E. Shannon,et al. The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..
[2] John Hooley. Boole's Method for Solving Boolean Equations , 1966 .
[3] A. Whitehead. Memoir on the Algebra of Symbolic Logic , 1901 .
[4] Antonin Svoboda. An Algorithm for Solving Boolean Equations , 1963, IEEE Trans. Electron. Comput..
[5] R. Luce. A note on Boolean matrix theory , 1952 .