Scratchpad's view of algebra II

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Scratchpad's view of algebra II: A categorical view of factorization

Full text

Pdf (767 KB)

Source

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

Bonn, West Germany

Pages: 32 - 38

Year of Publication: 1991

ISBN:0-89791-437-6

Authors

J. H. Davenport	School of Mathematics, University of Bath, Claverton Down, Bath BA2 7AY, England
P. Gianni	Dipartimento di Matematica, Università di Pisa, Via Buonarroti 2, 56100 Pisa, Italy
B. M. Trager	Mathematical Sciences Dept., IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY

Sponsors

GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 20, Citation Count: 1

Additional Information:

references cited by 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/120694.120699 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.

	Cantor & Zassenhaus, 1981	Cantor,D.G. ~ Z~ssenh~us,H., A New Algorithm for Factoring Polynomials over Finite Fields. Math. Comp. 36 (1981) pp. 587-592. Zbi. 493.12024. MR 82e:12020.
	Char et al., 1984	Bruce W. Char , Keith O. Geddes , Gaston H. Gonnet, GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation, Proceedings of the International Symposium on Symbolic and Algebraic Computation, p.285-296, July 09-11, 1984
	Davenport & Padget, 1985a	James H. Davenport , Julian A. Padget, HEUGCD: How Elementary Upperbounds Generated Cheaper Data, Research Contributions from the European Conference on Computer Algebra-Volume 2, p.18-28, April 01-03, 1985
	Davenport & Padget, 1985b	Davenport,J.H. ~ Padget,J.A., On Numbers ~ Polynomials. Computers and Computing (ed. P. Chenin, C. Dicrescenzo, F. Robert), Masson and Wiley, 1985, pp. 49-53.
	Davenport & Trager, 1990	James H. Davenport , Barry M. Trager, Scratchpad's View of Algebra I: Basic Commutative Algebra, Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems, p.40-54, April 10-12, 1990
	Fröhlich & Shepherdson, 1956	FrShlich,A. & Shepherdson,J.C., Effective Procedures in Field Theory. Phil. Trans. Roy. Soc. Set. A 248 (1955-6) pp. 407- 432. Zbl. 70,35.
	Jenks et al., 1988	R. D. Jenks , R. S. Sutor , S. M. Watt, Scratchpad II: an abstract datatype system for mathematical computation, Trends in computer algebra, Springer-Verlag New York, Inc., New York, NY, 1988
	Loos, 1982	Loos,l%., Generalized Polynomial l%emainder Sequences. Symbolic & Algebraic Computation (Computing Supplementum 4)(ed. B. Bttclberger, G.E. Collins & 1%. Loos) Springer-Vertag, Wien-New York, 1982, pp. 115-137
	Seidenberg, 1970	SeideItberg,A., Construction of the Integral Closure of a Finite Integral Domain. Rend. Sere. Mat. Fis. Milano 40 (1970) pp. 100-120. MR 45 #3396.
	Seidenberg, 1974	Seidenberg,A., Constructions in Algebra. Trans. AMS 197 (1974) pp. 273-313.
	Trager, 1976	Barry M. Trager, Algebraic factoring and rational function integration, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.219-226, August 10-12, 1976, Yorktown Heights, New York, United States [doi>10.1145/800205.806338]
	Yun, 1976	David Y.Y. Yun, On square-free decomposition algorithms, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.26-35, August 10-12, 1976, Yorktown Heights, New York, United States [doi>10.1145/800205.806320]
	Yun, 1977	Yun,D.Y.Y., On the Equivalence of Polynomial Gccl and Squarefree Factorization Algorithms. Proc. 1977 MACSYMA Users' Conference (NASA Publication CP-2012, NatioItal Technical IItformation Service, Springfield, Virginia) pp. 65-70.