What would the conqesquences of finding a quasi polynomial-time algorithm for 3-Sat?
Would this result in their being a quasi polynomial-time algorithm for all NP-complete problems?
$\begingroup$
$\endgroup$
1
-
3$\begingroup$ What do you think? Have you tried using the definition of NP-completeness? $\endgroup$ – Yuval Filmus Jun 8 '20 at 13:17
Add a comment
|
