All Questions
1
question
3
votes
1
answer
107
views
Prove 20-3-SAT is NP-Complete
so I have this problem that I can't figure out.
20-3-SAT={All satusfiable 3-CNF formulas where each variable appears at most 20 times}
I was able to prove it's in NP using verifier, but for NP-Hard ...
- 189