Heugcd: How elementary upperbounds generate cheaper data-Reference-Cited by-同舟云学术

Heugcd: How elementary upperbounds generate cheaper data

Published:1985 Issue: Volume: Page:18-28
ISSN:0302-9743
Container-title:EUROCAL '85
language:
Short-container-title:

Author:

Davenport James,Padget Julian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-15984-3_231.pdf

Reference14 articles.

1. 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.

2. 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.

3. 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

4. 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.

5. Davenport, J. H., On the Integration of Algebraic Functions. Springer Lecture Notes in Computer Science 102, 1981.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. So the problem has poor complexity: what next?;2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2023-09-11

2. A deterministic algorithm for finding r-power divisors;Research in Number Theory;2022-10-22

3. Certifying Irreducibility in $${\mathbb Z}[x]$$;Lecture Notes in Computer Science;2020

4. Scratchpad's view of algebra I: Basic commutative algebra;Design and Implementation of Symbolic Computation Systems;1990

5. GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation;Journal of Symbolic Computation;1989-01