Timeline for Is log(n) in complexity class P?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 18, 2015 at 11:55 | comment | added | Steve Jessop | @Kalissar: Quite a large constant, though, which is why hashtables are faster than trees, and sorting is slower than scanning ;-) | |
| Feb 18, 2015 at 10:49 | comment | added | Kalissar | My computer science professor always said that, when it comes to Computer Science, log(n) is a constant. | |
| Feb 18, 2015 at 8:19 | comment | added | Raphael | We have to be careful with the term "upper bounded" now. $n$ is not an upper bound of $10^{20} \log n$ in the usual sense, only asymptotically. | |
| Feb 17, 2015 at 23:16 | vote | accept | ShadSterling | ||
| S Feb 17, 2015 at 22:18 | history | edited | David Richerby | CC BY-SA 3.0 |
latex edit, link wrapper , $log$ to $\log$
|
| S Feb 17, 2015 at 22:18 | history | suggested | lucasoliveira | CC BY-SA 3.0 |
latex edit, link wrapper , $log$ to $\log$
|
| Feb 17, 2015 at 22:15 | review | Suggested edits | |||
| S Feb 17, 2015 at 22:18 | |||||
| Feb 17, 2015 at 19:24 | review | First posts | |||
| Feb 17, 2015 at 22:17 | |||||
| Feb 17, 2015 at 19:24 | history | answered | Mauricio | CC BY-SA 3.0 |