News for hackers. Stuff that matters.
Re:How to multiply polynomials in Θ(n log n) time by chaoxu on Tuesday September 08, 2015 @02:12AM (#10184296)
probabilistic convolution tree is not much more involved. In some sense it's just multiple polynomial multiplication.

But anyway, coin change problem can be solved much faster. http://link.springer.com/article/10.1007%2Fs00453-007-0162-8

Re:How to multiply polynomials in Θ(n log n) time by nonsequitur on Tuesday September 08, 2015 @04:46AM (#10184632)
Thanks! That paper is available on the author's website: http://gi.cebitec.uni-bielefeld.de/people/zsuzsa/papers/Algo...