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 14:09 | history | tweeted | twitter.com/#!/StackCompSci/status/568049762081103872 | ||
| Feb 18, 2015 at 8:17 | comment | added | Raphael | Check the definition of $O$. | |
| Feb 18, 2015 at 8:17 | history | edited | Raphael |
edited tags
|
|
| Feb 17, 2015 at 23:16 | vote | accept | ShadSterling | ||
| S Feb 17, 2015 at 22:06 | history | suggested | lucasoliveira | CC BY-SA 3.0 |
latex edit log to \log, O to mathcal{O}
|
| Feb 17, 2015 at 19:24 | answer | added | Mauricio | timeline score: 21 | |
| Feb 17, 2015 at 19:15 | review | Suggested edits | |||
| S Feb 17, 2015 at 22:06 | |||||
| Feb 17, 2015 at 19:11 | comment | added | user12859 | Just modify the algorithm to run longer. $\;$ | |
| Feb 17, 2015 at 18:58 | history | asked | ShadSterling | CC BY-SA 3.0 |