Timeline for Is $O(n^{f(n)})$ superexponential if $f(n)$ is a polynomial function such that $f(n) > n$ as $n$ approaches $\infty$?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 3 at 9:51 | comment | added | greybeard | I have one problem with this post's use of faster and slower: Given the context of time-complexity, does it refer to getting a result/completing an algorithm faster or slower? Or does it refer to something else? | |
| Mar 2 at 23:48 | answer | added | Nathaniel | timeline score: 2 | |
| Mar 2 at 23:35 | history | edited | Karlo Vizec | CC BY-SA 4.0 |
improved formatting
|
| Mar 2 at 23:35 | history | edited | Karlo Vizec | CC BY-SA 4.0 |
corrected spelling
|
| Mar 2 at 23:34 | history | edited | Karlo Vizec | CC BY-SA 4.0 |
clarified question title
|
| Mar 2 at 23:31 | history | edited | Karlo Vizec | CC BY-SA 4.0 |
added context
|
| Mar 2 at 23:25 | history | edited | Karlo Vizec | CC BY-SA 4.0 |
edited title
|
| S Mar 2 at 23:25 | review | First questions | |||
| Mar 13 at 10:11 | |||||
| S Mar 2 at 23:25 | history | asked | Karlo Vizec | CC BY-SA 4.0 |