Timeline for List of long open, elementary problems which are computational in nature
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 25, 2020 at 7:45 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
added 1 character in body
|
| Apr 24, 2020 at 17:04 | comment | added | Timothy Chow | Radziszowski's dynamic survey on small Ramsey numbers contains further examples with a similar flavor, but graph-theoretic rather than number-theoretic. | |
| Apr 24, 2020 at 15:45 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| Apr 24, 2020 at 7:33 | comment | added | Juan Sebastian Lozano | This is a cool problem, because you can approach it in a purely computational way and try to find N non-deterministically and then verify it as an upper bound (which shouldn't be too hard since for any given N there are a lot very trivial colorings), or you can try and build the number combinatorially, and both are interesting. | |
| Apr 24, 2020 at 7:02 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
edited body
|
| Apr 24, 2020 at 6:56 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
edited body
|
| Apr 24, 2020 at 6:51 | history | answered | Carlo Beenakker | CC BY-SA 4.0 |