A new modular algorithm for computation of algebraic number polynomial gcds

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A new modular algorithm for computation of algebraic number polynomial gcds

Full text

Pdf (463 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation table of contents

Portland, Oregon, United States

Pages: 91 - 94

Year of Publication: 1989

ISBN:0-89791-325-6

Author

T. J. Smedley

Department of Computer Science, University of Waterloo, Waterloo, Ontario, CANADA N2L 3G1

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 8, Citation Count: 1

Additional Information:

references cited by index terms review collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/74540.74552 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Russell John Bradford, On the computation of integral bases and defects of integrity, 1988
	2	W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journal of the ACM (JACM), v.18 n.4, p.478-504, Oct. 1971 [doi>10.1145/321662.321664]
	3	Bruce W. Char , Keith O. Geddes , Gaston H. Gonnet, GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation, Journal of Symbolic Computation, v.7 n.1, p.31-48, Jan. 1989 [doi>10.1016/S0747-7171(89)80004-5]
	4	G.E. Collins, "The SAC-1 Polynomial GCD and Resultant System," Technical Report, University of Wisconsin, University of Wisconsin, (1972).
	5	Keith O. Geddes , Gaston H. Gonnet , Trevor J. Smedley, Heuristic Methods for Operations With Algebraic Numbers. (Extended Abstract), Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation, p.475-480, July 04-08, 1988
	6	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	7	Lars Langemyr , Scott McCallum, The computation of polynomial greatest common divisors over an algebraic number field, Proceedings of the European Conference on Computer Algebra, p.298-299, June 02-05, 1987
	8	A. Schönhage, Probabilistic computation of integer polynomial GCDs, Journal of Algorithms, v.9 n.3, p.365-371, September 1988 [doi>10.1016/0196-6774(88)90027-2]

CITED BY

Mark J. Encarnación, On a modular algorithm for computing GCDs of polynomials over algebraic number fields, Proceedings of the international symposium on Symbolic and algebraic computation, p.58-65, July 20-22, 1994, Oxford, United Kingdom

INDEX TERMS

Primary Classification:
I. Computing Methodologies
I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION
I.1.2 Algorithms
Subjects: Algebraic algorithms

Additional Classification:
F. Theory of Computation
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.1 Numerical Algorithms and Problems
Subjects: Computations on polynomials

General Terms:
Algorithms, Theory

REVIEW

"Hale F. Trotter : Reviewer"

The problem considered is computing the gcd of two polynomials with coefficients in Q(&agr;), where &agr; is a root of a given polynomial p(z) in Z more...

Collaborative Colleagues:

T. J. Smedley: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player