Boolean Circuits · NAND Game
Lesson 3
Problem. Synthesize a circuit of size \(2\) over \(\{\operatorname{NAND}_{2}, \operatorname{INV}_{1}\}\) computing the conjunction of two bits: \[\operatorname{AND}_{2}(x_{1},x_{2})=z=x_{1} \land x_{2}.\]
Boolean Circuits · NAND Game
Problem. Synthesize a circuit of size \(2\) over \(\{\operatorname{NAND}_{2}, \operatorname{INV}_{1}\}\) computing the conjunction of two bits: \[\operatorname{AND}_{2}(x_{1},x_{2})=z=x_{1} \land x_{2}.\]