Timeline for Problem in deterministic time $n^p$ and not lower
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 10, 2020 at 9:59 | comment | added | Michael Wehar | Thank you for sharing! I actually hadn't known about the paper "How hard are n^2-hard problems?" but was aware of their theorem. It really helps to have a more complete history. | |
| Feb 10, 2020 at 9:57 | history | edited | Michael Wehar | CC BY-SA 4.0 |
added 18 characters in body
|
| Feb 10, 2020 at 3:07 | comment | added | ULechine | I am accepting this answer because as of the current state of research it seems that standalone conjecture is the state of the art. | |
| Feb 10, 2020 at 3:06 | vote | accept | ULechine | ||
| Feb 10, 2020 at 3:06 | history | answered | ULechine | CC BY-SA 4.0 |