2
votes
Is there a 2SAT encoding for a NAND gate
It seems, based on the comments in other answers, that what you are after is a 2-CNF formula $\phi(q, a, b)$ equivalent to $q \iff \overline{a \land b}$. This is indeed not possible; the only possible ...
1
vote
Is there a 2SAT encoding for a NAND gate
There is no proof that it is impossible, but it is believed that it's unlikely to be possible, because if you could convert every circuit with NAND gates to 2CNF, you would have a proof that P = ...

D.W.♦
- 154k
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
circuits × 294complexity-theory × 150
logic × 28
boolean-algebra × 24
digital-circuits × 18
lower-bounds × 15
complexity-classes × 14
turing-machines × 13
quantum-computing × 13
algorithms × 11
reference-request × 11
satisfiability × 10
time-complexity × 9
computability × 9
reductions × 9
computation-models × 8
polynomial-time × 8
computer-architecture × 7
space-complexity × 7
boolean-complexity × 7
np-complete × 6
arithmetic × 6
sequential-circuit × 5
graphs × 4
optimization × 4