Timeline for Why can we not find exact values for sizes of cap sets for $d>6$?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7 at 16:44 | history | edited | Oscar Lanzi | CC BY-SA 4.0 |
edited body
|
| Aug 7 at 16:38 | history | edited | Oscar Lanzi | CC BY-SA 4.0 |
Modified to incorporate a comment.
|
| Aug 7 at 16:23 | history | edited | Oscar Lanzi | CC BY-SA 4.0 |
Modified to incorporate a comment.
|
| Aug 7 at 15:06 | comment | added | Terry Tao | It should be pointed out that the situation is even worse: all known algorithms to compute the size of the maximal cap set are doubly exponential in $d$, rather than singly exponential. For instance, naive brute force search has the runtime of $2^{3^d}$. Even the $P=NP$ conjecture would "merely" cut this runtime down to singly exponential. | |
| Dec 11, 2023 at 18:17 | comment | added | 15948238 | I understand now, thank you for the help! | |
| Dec 11, 2023 at 17:37 | history | edited | Oscar Lanzi | CC BY-SA 4.0 |
added 14 characters in body
|
| Dec 11, 2023 at 17:33 | history | edited | GH from MO | CC BY-SA 4.0 |
added 61 characters in body
|
| Dec 11, 2023 at 17:30 | history | answered | Oscar Lanzi | CC BY-SA 4.0 |