The modulo N extended GCD problem for polynomials

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The modulo N extended GCD problem for polynomials

Full text

Pdf (301 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1998 international symposium on Symbolic and algebraic computation table of contents

Rostock, Germany

Pages: 105 - 112

Year of Publication: 1998

ISBN:1-58113-002-3

Authors

Thom Mulders	Institute of Scientific Computing, ETH Zurich, Switzerland
Arne Storjohann	Institute of Scientific Computing, ETH Zurich, Switzerland

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 18, Citation Count: 0

Additional Information:

references index terms 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/281508.281586 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	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	P. D. Domich , R. Kannan , L. E. Trotter, Jr., Hermite normal form computation using modulo determinant arithmetic, Mathematics of Operations Research, v.12 n.1, p.50-59, Feb. 1987 [doi>10.1287/moor.12.1.50]
	3	Mark Giesbrecht, Fast computation of the Smith normal form of an integer matrix, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.110-118, July 10-12, 1995, Montreal, Quebec, Canada [doi>10.1145/220346.220361]
	4	IWANIEC, H. On the problem of Jacobsthal. Demonstratio Mathematica 11, 1 (1978), 225--231.
	5	JACOBSTHAL, E. /Jber Sequenzen ganzer Zahlen, von denen keine zu n teilerfremd ist I-III. Norske Vid. Selsk. Forhdl. 33 (1960), 117-124, 125-131, 132-139.
	6	E. Kaltofen , M. S. Krishnamoorthy , B. D. Saunders, Fast parallel computation of hermite and smith forms of polynomial matrices, SIAM Journal on Algebraic and Discrete Methods, v.8 n.4, p.683-690, Oct. 1987 [doi>10.1137/0608057]
	7	KALTOFEN, E., KRISHNAMOORTHY, M. S., AND SAUN- DERS, B. D. Parallel algorithms for matrix normal forms. Linear Algebra and its Applications 136 (1990), 189-208.
	8	KANOLD, H.-J. /Jber eine zahlentheoretische Funktion von Jacobsthal. Math. Annalen 170 (1967), 314-326.
	9	Arne Storjohann, A solution to the extended GCD problem with applications, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.109-116, July 21-23, 1997, Kihei, Maui, Hawaii, United States [doi>10.1145/258726.258762]
	10	STORJOHANN, A., AND LABAHN, G. A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix. Linear Algebra and its Applications 253 (1997), 155--173.
	11	Arne Storjohann , Thom Mulders, Fast Algorithms for for Linear Algebra Modulo N, Proceedings of the 6th Annual European Symposium on Algorithms, p.139-150, August 24-26, 1998
	12	Gilles Villard, Generalized subresultants for computing the Smith normal form of polynomial matrices, Journal of Symbolic Computation, v.20 n.3, p.269-286, Sept. 1995 [doi>10.1006/jsco.1995.1050]
	13	VILLARD, G. Fast parallel algorithms for matrix reduction to normal forms. Applicable Algebra in Engineering, Communication and Control 8 (1997), 511--537.