skip to main content
article
Free access

A comparison of the Vaxima and Reduce factorization packages

Published: 01 February 1983 Publication History

Abstract

During 1979 the programmed version of the multivariate factorization algorithm described in [6] stabilized and replaced the old factoring algorithm in Macsyma as the standard factorizer. It has thus graduated from being a program written as part of a research project into being a tool that anyone with a copy of Macsyma may rely on. In 1981, a factoring package [4] was being prepared for distribution as a module in a forthcoming release of Reduce. During September 1982 the two authors were able to make some direct comparisons between their codes by running both factorizers on the same set of examples on the same computer at the same time. This note reports on the comparative timings so obtained.

References

[1]
E. Benson and M. Griss, "The Portable Standard Lisp Users Manual" (version 3, 26 July 1982), The Utah Symbolic Computation Group, University of Utah Computer Sciences Department, technical report TR-10.
[2]
A. C. Hearn, REDUCE II a system for Algebraic Computation, The University of Utah, Computer Sciences Department, 1979.
[3]
E. Kaltofen, D. Musser, and B. Saunders, "A generalized Class of Polynomials that are Hard to Factor, "Proceedings, ACM Symposium on Symbolic and Algebraic Computation", Aug. 1981.
[4]
P. M. A. Moore and A. C. Norman, "Implementing a polynimial factorization and GCD package, "Proceedings, ACM Symposium on Symbolic and Algebraic Computation", August 1981, pp. 109--113.
[5]
R. Pavelle, M. Rothstein and J. Fitch, "Computer Algebra", Scientific American, Vol 245 No. 6, December 1981, pp. 136--152.
[6]
P. S. Wang, "An improved multivariate polynomial factoring algorithm", Math. Comp., v. 32, October 1978, pp. 1215--1231.

Cited By

View all
  • (1986)A fast implementation of polynomial factorizationProceedings of the fifth ACM symposium on Symbolic and algebraic computation10.1145/32439.32485(228-232)Online publication date: 1-Oct-1986

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSAM Bulletin
ACM SIGSAM Bulletin  Volume 17, Issue 1
February 1983
41 pages
ISSN:0163-5824
DOI:10.1145/1089320
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1983
Published in SIGSAM Volume 17, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)28
  • Downloads (Last 6 weeks)4
Reflects downloads up to 13 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (1986)A fast implementation of polynomial factorizationProceedings of the fifth ACM symposium on Symbolic and algebraic computation10.1145/32439.32485(228-232)Online publication date: 1-Oct-1986

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media