Hardness of 3SAT-k
-
01-11-2019 - |
سؤال
According to these scribe notes (and a paper), 3SAT-5 is NP-hard. The problem is defined to be: given a 3SAT formula, each variable occurs in at most 5 clauses. It is also proven that 3SAT-4 is NP-hard.
What is the computational complexity of 3SAT-$k$ for $k \le 3$?
لا يوجد حل صحيح
لا تنتمي إلى cs.stackexchange