![](/img/cover-not-exists.png)
On the complexity of computing the GCD of two polynomials via Hankel matrices
Belhaj, Skander, Kahla, Haïthem BenVolume:
46
Language:
english
Journal:
ACM Communications in Computer Algebra
DOI:
10.1145/2429135.2429140
Date:
January, 2013
File:
PDF, 147 KB
english, 2013