Why is no one talking about the new fast polynomial composition algorithm?
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en10 |
![]() |
Kapt | 2024-04-25 21:03:50 | 213 | ||
en9 |
![]() |
Kapt | 2024-04-09 17:33:03 | 118 | ||
en8 |
![]() |
Kapt | 2024-04-08 19:44:43 | 2 | Tiny change: 'es a somewaht differen' -> 'es a somewhat differen' | |
en7 |
![]() |
Kapt | 2024-04-08 19:41:56 | 214 | ||
en6 |
![]() |
Kapt | 2024-04-08 18:45:33 | 34 | ||
en5 |
![]() |
Kapt | 2024-04-08 18:44:36 | 0 | (published) | |
en4 |
![]() |
Kapt | 2024-04-08 18:39:47 | 164 | Tiny change: 'log^2(n))$, so by [T' -> 'log^2(n))$ with Bostan-Mori algorithm, so by [T' | |
en3 |
![]() |
Kapt | 2024-04-08 18:30:49 | 150 | Tiny change: 'ginal blog. Previous' -> 'ginal blog (in Japanese). Previous' | |
en2 |
![]() |
Kapt | 2024-04-08 18:16:45 | 3668 | Tiny change: '(V)=deg(Q) and deg(U_i) \' -> '(V)=deg(Q)$ and $deg(U_i) \' | |
en1 |
![]() |
Kapt | 2024-04-08 17:01:02 | 280 | Initial revision (saved to drafts) |