Non-deterministic polynomial

前端 未结 0 1036
醉梦人生
醉梦人生 2020-12-04 01:24

The questions asks whether the statement "if 3-CNF-SAT is P, then clique is also P" is true or false. We know that 3-CNF-SAT can be reduced to clique in polynomial

相关标签:
回答
  • 消灭零回复
提交回复
热议问题