Timeline for Possible $\mathsf{NP}$ complete problem from number theory
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 21, 2017 at 7:13 | comment | added | user5810 | In this case, it means the proof allows construction of a specific algorithm and polynomial runtime-bound, rather than just showing that such exist. | |
| May 20, 2017 at 9:25 | comment | added | Turbo | @RickyDemer what does effective mean here concretely? | |
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Aug 3, 2015 at 15:12 | history | edited | Turbo | CC BY-SA 3.0 |
deleted 9 characters in body
|
| Aug 3, 2015 at 13:36 | comment | added | user5810 | Are you using "effectively" in the informal sense? $\:$ If yes, then Cramér's conjecture is makes version #4 of Shor's answer "effectively deterministic". $\:$ If no, what does "effectively deterministic" mean? $\;\;\;\;$ | |
| Aug 3, 2015 at 11:57 | history | edited | Turbo | CC BY-SA 3.0 |
edited tags
|
| Aug 3, 2015 at 11:56 | history | undeleted | Turbo | ||
| Aug 2, 2015 at 6:21 | history | deleted | Turbo | via Vote | |
| Aug 2, 2015 at 4:50 | comment | added | user5810 | That post of mine and the answer to it together are enough to make the reduction effective (in the mathematical sense). $\;$ | |
| Aug 2, 2015 at 1:29 | history | edited | Turbo | CC BY-SA 3.0 |
added 136 characters in body
|
| Aug 2, 2015 at 1:25 | history | edited | GH from MO |
edited tags
|
|
| Aug 2, 2015 at 1:18 | history | asked | Turbo | CC BY-SA 3.0 |