Skip to main content
MathOverflow
WiccanKarnak's user avatar
WiccanKarnak's user avatar
WiccanKarnak's user avatar
WiccanKarnak
  • Member for 5 years, 3 months
  • Last seen more than 2 years ago
Profile Activity

11 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Scholar
accepted
Process quicker than Fourier for squares of polynomials
awarded
 Editor
awarded
 Supporter
revised
Process quicker than Fourier for squares of polynomials
Made the question even more concise
comment
Process quicker than Fourier for squares of polynomials
@The_Sympathizer yes, adding that would help a lot, as I mentioned in the question
comment
Process quicker than Fourier for squares of polynomials
@GerhardPaseman can you please post it as an answer? It's exactly what I am looking for, thanks so much.
awarded
 Student
comment
Process quicker than Fourier for squares of polynomials
@GerhardPaseman can you prove so? (or if you already did that above, can you write it with big O notations/ give some upper limit that can't be crossed?)
asked
Process quicker than Fourier for squares of polynomials
awarded
 Autobiographer