Timeline for Hard problems with an easy-to-understand answer
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7 at 6:28 | history | edited | David Roberts♦ | CC BY-SA 4.0 |
Full reference and doi link
|
| Jun 1 at 6:22 | comment | added | Gerry Myerson | @Sam, it did also occur to me that examples/counterexamples are the most likely results to qualify as answers to this question. After all, if a problem is open for ten or more years, and falls to a short argument of an elementary type, that argument is most likely some kind of lengthy computation with a simple verification. | |
| May 31 at 22:50 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| May 31 at 17:37 | comment | added | Sam Hopkins | Your two answers concern examples (or counter-examples). And it is quite understandable why: it fits with the "NP" paradigm in computer science that there can be examples which are hard to find but which are easy to verify. Nevertheless, I wonder whether there are answers that are more traditional theorems (universally quantified statements, say). | |
| May 28 at 4:06 | history | answered | Gerry Myerson | CC BY-SA 4.0 |