Generic reductions for in-place polynomial multiplication


الملخص بالإنكليزية

The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been made to improve the space complexity, developing modifi

تحميل البحث