Cite
HARVARD Citation
Lecerf, G. (2019). On the complexity of the Lickteig–Roy subresultant algorithm. Journal of symbolic computation. pp. 243-268. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Lecerf, G. (2019). On the complexity of the Lickteig–Roy subresultant algorithm. Journal of symbolic computation. pp. 243-268. [Online].