A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials

From MaRDI portal
Publication:4610021

DOI10.1007/978-3-319-56932-1_24zbMath1396.13028OpenAlexW2739046436MaRDI QIDQ4610021

Sirani M. Perera, Vadim Olshevsky

Publication date: 5 April 2018

Published in: Applications of Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56932-1_24



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).




Cites Work


This page was built for publication: A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials