This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
11-References
Cauchy, M.A., 1829 Exercies de Mathématiques, Quatrième Année. Les Oeuvres Compiètes d'Augustin Cauchy. IIe Série, Tome IX. (Bibliothèque Nationale, Paris), pp. 122–123.
Char,B.W., Geddes,K.O., Gentleman,W.M., and Gonnet,G.H., The Design of MAPLE: a Compact, Portable and Powerful Computer Algebra System. Proc. EUROCAL 83 (Springer Lecture Notes in Computer Science 162), pp. 101–115.
Char, B. W., Fee, G. J., Geddes, K. O., Gonnet, G. H., Monagan, M. B., and Watt, S. W., On the Design and Performance of the MAPLE System. University of Waterloo, Research Report CS-84-13, June 1984
Char, B. W., Geddes, K. O. & Gonnet, G. H., GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation. Proc. EUROSAM 84 (Springer Lecture Notes in Computer Science 174) pp. 285–296.
Davenport, J. H., On the Integration of Algebraic Functions. Springer Lecture Notes in Computer Science 102, 1981.
Fitch, J. P. & Norman, A. C., Implementing LISP in a High-Level Language. Software — Practice & Expreience 7(1977) pp. 713–725.
Hearn, A. C., Non-Modular Computation of Polynomial Gcd Using Trial Division. Proc EUROSAM 79 (Springer Lecture Notes in Computer Science 72), pp. 227–239.
Hearn, A. C., REDUCE — A Case Study in Algebra System Development. Proc EUROCAM 82 (Springer Lecture Notes in Computer Science 144), pp. 263–272.
Landau, E., Sur queiques théorèmes de M. Petrovic rélatifs aux zeros des fonctions analytiques. Bull. Math. Soc. France 33(1905) pp. 251–261.
Mignotte, M., An Inequallty About Factors of Polynomials. Math. Comp. 28(1974) pp. 1153–1157.
Mignotte, M., Some Useful Bounds. Symbolic & Algebraic Computation (Computing Supplementum 4), Springer-Verlag 1982, pp. 259–263.
Moore, P. M. A. & Norman, A. C., Implementing a Polynomial Factorization and GCD Package. Proc. SYMSAC 81, ACM, New York, 1981, pp. 109–116.
Padget, J. A. & Davenport, J. H., Number Bases in an Algebra System. To appear in SIGSAM Bulletin.
Stoutemyer, D. R., Which Polynomial Representation is Best: Surprises Abound. Proc. 1984 MACSYMA Users' Conference. General Electric. Schenectady, 1984, pp. 221–243.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Davenport, J., Padget, J. (1985). Heugcd: How elementary upperbounds generate cheaper data. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_231
Download citation
DOI: https://doi.org/10.1007/3-540-15984-3_231
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15984-1
Online ISBN: 978-3-540-39685-7
eBook Packages: Springer Book Archive