31 citations · 70 across the 19 of their papers we have counts for
Showing 2018 · cs.SCShow all
2 papers · 2 filters
cs.SC2018
Putting Fürer Algorithm into Practice with the BPAS Library
Sviatoslav Covanov, Davood Mohajerani, Marc Moreno-Maza +1
Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{ö}nhage and Strassen designed…
cs.SC2018★ 3 cited
Complexity Estimates for Fourier-Motzkin Elimination
Rui-Juan Jing, Marc Moreno-Maza, Delaram Talaashrafi
In this paper, we propose a new method for removing all the redundant inequalities generated by Fourier-Motzkin elimination. This method is based on an improved version of Balas' w…