Mathematics
References¶
| Key | Work |
|---|---|
| Arnold 2003 | E. A. Arnold, "Modular algorithms for computing Gröbner bases", Journal of Symbolic Computation 35 (2003), 403–419. |
| Basu, Pollack and Roy 2006 | S. Basu, R. Pollack, and M.-F. Roy, Algorithms in Real Algebraic Geometry, 2nd edition, Springer, 2006. |
| Berlekamp 1967 | E. R. Berlekamp, "Factoring polynomials over finite fields", Bell System Technical Journal 46 (1967), 1853–1859. |
| Brown 1971 | W. S. Brown, "On Euclid's algorithm and the computation of polynomial greatest common divisors", Journal of the ACM 18 (1971), 478–504. |
| Brown and Traub 1971 | W. S. Brown and J. F. Traub, "On Euclid's algorithm and the theory of subresultants", Journal of the ACM 18 (1971), 505–514. |
| Buchberger 1965 | B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, PhD thesis, University of Innsbruck, 1965. |
| Cantor and Zassenhaus 1981 | D. G. Cantor and H. Zassenhaus, "A new algorithm for factoring polynomials over finite fields", Mathematics of Computation 36 (1981), 587–592. |
| Collins 1967 | G. E. Collins, "Subresultants and reduced polynomial remainder sequences", Journal of the ACM 14 (1967), 128–142. |
| Collins and Akritas 1976 | G. E. Collins and A. G. Akritas, "Polynomial real root isolation using Descartes' rule of signs", Proceedings of SYMSAC 1976, ACM. |
| Cox, Little and O'Shea 2015 | D. A. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms, 4th edition, Springer, 2015. |
| Faugère 1999 | J.-C. Faugère, "A new efficient algorithm for computing Gröbner bases (F4)", Journal of Pure and Applied Algebra 139 (1999), 61–88. |
| Gebauer and Möller 1988 | R. Gebauer and H. M. Möller, "On an installation of Buchberger's algorithm", Journal of Symbolic Computation 6 (1988), 275–286. |
| Mignotte 1974 | M. Mignotte, "An inequality about factors of polynomials", Mathematics of Computation 28 (1974), 1153–1157. |
| Sturm 1829 | C. Sturm, "Mémoire sur la résolution des équations numériques", Bulletin des Sciences de Férussac 11 (1829). |
| von zur Gathen and Gerhard 2013 | J. von zur Gathen and J. Gerhard, Modern Computer Algebra, 3rd edition, Cambridge University Press, 2013. |
| Yun 1976 | D. Y. Y. Yun, "On square-free decomposition algorithms", Proceedings of SYMSAC 1976, ACM. |
| Zassenhaus 1969 | H. Zassenhaus, "On Hensel factorization, I", Journal of Number Theory 1 (1969), 291–311. |
Bibliographic details were written from memory; check them against the sources before publishing the site. Section and theorem numbers cited for Modern Computer Algebra and Ideals, Varieties, and Algorithms follow the editions above and may differ in others.