Subresultants revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1776 LNCS, Issue , 2000, Pages 318-342

  Von Zur Gathen, Joachim ^a   Lücking, Thomas ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84896749917     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10719839_33     Document Type: Conference Paper

References (36)

1. Étienne Bézout, Recherches sur le degré des équations résultantes de l'évanouissement des inconnues. Histoire de l'académie royale des sciences (1764), 288-338. Summary 88-91.
2. Otto Biermann, Über die Resultante ganzer Functionen. Monatshefte fuer Mathematik und Physik (1891), 143-146. II. Jahrgang.
3. W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors. Journal of the ACM 18(4) (1971), 478-504.
4. W. S. Brown, The Subresultant PRS Algorithm. ACM Transactions on Mathematical Software 4(3) (1978), 237-249.
5. W. S. Brown and J. F. Traub, On Euclid's Algorithm and the Theory of Subresul-tants. Journal of the ACM 18(4) (1971), 505-514.
6. G. E. Collins, Polynomial remainder sequences and determinants. The American Mathematical Monthly 73 (1966), 708-712.
7. George E. Collins, Subresultants and Reduced Polynomial Remainder Sequences. Journal of the ACM 14(1) (1967), 128-142.
8. George E. Collins, The Calculation of Multivariate Polynomial Resultants. Journal of the ACM 18(4) (1971), 515-532.
9. G. E. Collins, Computer algebra of polynomials and rational functions. The American Mathematical Monthly 80 (1973), 725-755.
10. Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, and George Havas, Gcd of many integers. In COCOON '99, ed. T. Asano et al., Lecture Notes in Computer Science 1627. Springer-Verlag, 1999, 310-317.
11. Leonhard Euler, Démonstration sur le nombre des points où deux lignes des ordres quelconques peuvent se couper. Mémoires de l'Académie des Sciences de Berlin 4 (1748), 1750, 234-248.
12. Eneström 148. Opera Omnia, ser. 1, Vol. 26, Orell Füssli, Zürich, 1953, 46-59.
13. Joachim von zur Gathen, Parallel algorithms for algebraic problems. SIAM Journal on Computing 13(4) (1984), 802-824.
14. Joachim von zur Gathen and Jürgen Gerhard, Modern Computer Algebra. Cambridge University Press, 1999.
15. K. O. Geddes, S. R. Czapor, and G. Labahn, Algorithms for Computer Algebra. Kluwer Academic Publishers, 1992.
16. Paul Gordan, Vorlesungen über Invariantentheorie. Erster Band: Determinanten. B. G. Teubner, Leipzig, 1885. Herausgegeben von Georg Kerschensteiner.
17. Walter Habicht, Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens. Commentarii Mathematici Helvetici 21 (1948), 99-116.
18. M. W. Haskell, Note on resultants. Bulletin of the New York Mathematical Society 1 (1892), 223-224.
19. Thomas W. Hungerford, Abstract Algebra: An Introduction. Saunders College Publishing, Philadelphia PA, 1990.
20. C. G. J. Jacobi, De eliminatione variabilis e duabus aequationibus algebraicis. Journal für die Reine und Angewandte Mathematik 15 (1836), 101-124.
21. Donald E. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms. Addison-Wesley, Reading MA, 2nd edition, 1981.
22. L. Kronecker, Die verschiedenen Sturmschen Reihen und ihre gegenseitigen Beziehungen. Monatsberichte der Königlich Preussischen Akademie der Wissenschaften, Berlin (1873), 117-154.
23. L. Kronecker, Zur Theorie der Elimination einer Variabeln aus zwei algebraischen Gleichungen. Monatsberichte der Königlich Preussischen Akademie der Wissenschaften, Berlin (1881), 535-600.
24. Werke, Zweiter Band, ed. K. Hensel, Leipzig, 1897, 113-192. Reprint by Chelsea Publishing Co., New York, 1968.
25. Thomas Lickteig and Marie-Françoise Roy, Cauchy Index Computation. Calcolo 33 (1997), 331-357.
26. R. Loos, Generalized Polynomial Remainder Sequences. Computing 4 (1982), 115-137.
27. Thom Mulders, A note on subresultants and the Lazard/Rioboo/Trager formula in rational function integration. Journal of Symbolic Computation 24(1) (1997), 45-50.
28. Isaac Newton, Arithmetica Universalis, sive de compositione et resolutione arith-metica liber. J. Senex, London, 1707.
29. English translation as Universal Arithmetick: or, A Treatise on Arithmetical composition and Resolution, translated by the late Mr. Raphson and revised and corrected by Mr. Cunn, London, 1728.
30. Reprinted in: Derek T. Whiteside, The mathematical works of Isaac Newton, Johnson Reprint Co, New York, 1967, p. 4ff.
31. Daniel Reischert, Asymptotically Fast Computation of Subresultants. In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation ISSAC '97, Maui HI, ed. Wolfgang W. Küchlin. ACM Press, 1997, 233-240.
32. V. Strassen, The computational complexity of continued fractions. SIAM Journal on Computing 12(1) (1983), 1-27.
33. C. Sturm, Mémoire sur la résolution des équations numériques. Mémoires présenté s par divers savants à l'Acadèmie des Sciences de l'Institut de France 6 (1835), 273-318.
34. J. J. Sylvester, A method of determining by mere inspection the derivatives from two equations of any degree. Philosophical Magazine 16 (1840), 132-135.
35. Mathematical Papers 1, Chelsea Publishing Co., New York, 1973, 54-57.
36. Richard Zippel, Effective polynomial computation. Kluwer Academic Publishers, 1993.