Timeline for answer to In the neutral zone between polynomial and sub-exponential by user1271772
Current License: CC BY-SA 4.0
Post Revisions
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 23, 2020 at 6:46 | comment | added | Emil Jeřábek | The running time of the algorithm is (up to less significant factors) $2^{n^\epsilon}$ for some constant $\epsilon>0$. More often than not, bounds of this form are considered exponential in complexity theory. See also cs.stackexchange.com/a/9814. | |
| Jun 22, 2020 at 23:03 | history | answered | user1271772 | CC BY-SA 4.0 |