Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Algorithms and Computation in Mathematics;S. Basu,2003
2. Bertot, Y., Casteran, P.: Interactive Theorem Proving and Program Development. Coq’Art: the Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)
3. Boulmé, S.: Vers la spécification formelle d’un algorithme non trivial de calcul formel: le calcul de pgcd de deux polynômes par la chaîne de pseudo-restes de sous-résultants. Master’s thesis, SPI team, Paris VI University (September 1997)
4. Brown, W.S., Traub, J.F.: On Euclid’s Algorithm and the The Theory of Subresultants. Journal of the ACM 18(4), 505–514 (1971)
5. Collins, G.E.: Subresultant and Reduced Polynomial Remainder Sequences. Journal of the ACM 14, 128–142 (1967)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献