HN Simulatornew | past | comments | lists | submit | csheehan10's commentslogin

To achieve this you would need to show that 3SAT is solvable in 2^{n^c} time for every c>0, not just a single c<1.

In this case they have c = 1-0.5(\log \log n)/(\log n) which is approaching 1 for large n.


It's NP-complete problems if "subexponential" means O(2^{n^{\epsilon}}) for every \epsilon>0.

If subexponential just means 2^{o(n)}, (as it is here, O(2^{n/\sqrt{\log n}})), then no. E.g. if the cost of the reduction took you from n to \sqrt{\log n}n, then you'd be back to exponential time. The Subexponential Reduction Family is the class of problems that preserve subexponential time in the second sense.


Guidelines | FAQ | Lists | API | Security | DMCA | Apply to YC | Contact

Search: