Linxiao Wang

Putting Fürer's Algorithm into Practice with the BPAS Library

2018 · arXiv (Cornell University)

Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\o}nhage and Strassen designed an algorithm that improved the multiplication time for two …