The complexity of Boolean functions
The complexity of Boolean functions
Automated Reasoning: Introduction and Applications
Automated Reasoning: Introduction and Applications
Hi-index | 0.00 |
As an example of a logic circuit design problem, we consider the two-inverter puzzle [1] which may be stated as follows:Using any number of AND, OR gates but no more than two NOT gates (inverters), design a logic circuit with three inputs i1, i2, i3 and three outputs o1, o2, 03 such that o1=NOT (il), o2=NOT (i2), o3=NOT (i3).