Short proofs for tricky formulas
Acta Informatica
Improved Techniques for Estimating Signal Probabilities
IEEE Transactions on Computers
Translation of the Problem of Complete Test Set Generation to Pseudo-Boolean Programming
IEEE Transactions on Computers
Lattice functions and equations
Lattice functions and equations
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
An Investigation of the Laws of Thought
An Investigation of the Laws of Thought
Solving Boolean Equations Using ROSOP Forms
IEEE Transactions on Computers
Some Additions to "Solution of Switching Equations Based on a Tabular Algebra"
IEEE Transactions on Computers
Comments on 'Some Additions to Solution of Switching Equations Based on a Tabular Algebra'
IEEE Transactions on Computers
Solution of systems of Boolean equations via the integer domain
Information Sciences: an International Journal
| Hi-index | 14.99 |
Several problems in switching theory such as automatic test pattern generation, can be exactly and elegantly investigated by using switching equations. An efficient tabular method is presented to solve these switching equations. The solutions of a given equation are compacted into a table, and a Boolean algebra is defined for these tables. The proposed procedure is based on the use of this Boolean algebra. The compactness and simplicity of the method are outstanding, and it is straightforward to implement for computer processing. The complexity of the procedure is computed, and some experimental results for a set of benchmark equations are provided in order to point out the effectiveness of this method.