Timeline for Complexity of establishing finite groups (non)-isomorphism ?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 18, 2022 at 18:51 | answer | added | Joshua Grochow | timeline score: 5 | |
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Nov 10, 2012 at 16:49 | vote | accept | Alexander Chervov | ||
| Nov 5, 2012 at 14:46 | comment | added | Andreas Blass | @Derek: Yes, I do. Too bad comments can't be edited. | |
| Nov 4, 2012 at 22:35 | comment | added | Derek Holt | Don't you mean $e^{N \log N}$? | |
| Nov 4, 2012 at 14:54 | comment | added | Andreas Blass |
"Exponential" is sometimes used to mean 2 to a polynomial exponent and sometimes to mean 2 to a linear exponent. So there can be disagreement as to whether $N!$ (or equivalently $N^{\log N}$) counts as exponential.
|
|
| Nov 4, 2012 at 10:56 | answer | added | Derek Holt | timeline score: 6 | |
| Nov 4, 2012 at 10:44 | history | edited | Alexander Chervov | CC BY-SA 3.0 |
added 1000 characters in body
|
| Nov 4, 2012 at 10:29 | history | edited | Alexander Chervov | CC BY-SA 3.0 |
added 8 characters in body
|
| Nov 4, 2012 at 10:20 | history | asked | Alexander Chervov | CC BY-SA 3.0 |