Why is no one talking about the new fast polynomial composition algorithm?

Revision en1, by Kapt, 2024-04-08 17:01:02

So, about three weeks ago a fast ($$$\mathcal{O}(n\log^2(n))$$$) algorithm has been discovered by noshi91, here is the original blog.

Tags advanced math

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en10 English Kapt 2024-04-25 21:03:50 213
en9 English Kapt 2024-04-09 17:33:03 118
en8 English Kapt 2024-04-08 19:44:43 2 Tiny change: 'es a somewaht differen' -> 'es a somewhat differen'
en7 English Kapt 2024-04-08 19:41:56 214
en6 English Kapt 2024-04-08 18:45:33 34
en5 English Kapt 2024-04-08 18:44:36 0 (published)
en4 English 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 English Kapt 2024-04-08 18:30:49 150 Tiny change: 'ginal blog. Previous' -> 'ginal blog (in Japanese). Previous'
en2 English 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 English Kapt 2024-04-08 17:01:02 280 Initial revision (saved to drafts)