Simplification of algebraic expression by multiterm rewriting rules

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Simplification of algebraic expression by multiterm rewriting rules

Full text

Pdf (434 KB)

Source

Symposium on Symbolic and Algebraic Manipulation archive
Proceedings of the fifth ACM symposium on Symbolic and algebraic computation table of contents

Waterloo, Ontario, Canada

Pages: 115 - 120

Year of Publication: 1986

ISBN:0-89791-199-7

Author

Tateaki Sasaki

Institute of Physical and Chemical Research, Saitama, Japan

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 32, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues peer to peer

Tools and Actions:	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/32439.32463 What is a DOI?

ABSTRACT

In simplifying an algebraic expression, human often applies multiterm rewriting rules cleverly. This paper describes a simple multiterm rewriting algorithm which simulates human simplification naively. The algorithm is simple but seems to be quite useful for many applications.

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.

	Brenn84	Brenner R.L., "Simplifying large algebraic expressions by computer," Proc. of {984 MACSYMA User's Conf., General Electric, 1984, pp. 50-107.
	Brown69	Brown W.S., "Rational Exponential Expressions and a conjecture concerning ~r and e," Amer. Math. Monthly 76, pp. 28-34 (1969).
	Buchb65	Buchberger B., "Ein Algorithmus zmn Auffinden der Basiselemente des Restkiassenringes nach einem nuIldimensionalen Polynomideal," University of Innsbruck, 1965.
	Cavin70	B. F. Caviness, On Canonical Forms and Simplification, Journal of the ACM (JACM), v.17 n.2, p.385-396, April 1970 [doi>10.1145/321574.321591]
	Hearn84	Hearn, A.C., "Structure: The key to improved algebraic computation," Proc. of RSYMSAC, Riken, Japan, 1984.
	Hornf82	Lars Hörnfeldt, A Sum-Substitutor Used as Trigonometric Simplifier, Proceedings of the European Computer Algebra Conference on Computer Algebra, p.188-195, April 05-07, 1982
	Lauer76	Markus Lauer, Canonical representatives for residue classes of a polynomial ideal, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.339-345, August 10-12, 1976, Yorktown Heights, New York, United States [doi>10.1145/800205.806353]
	MACSY77	The MATHLAB Group, "MACSYMA Reference Manual," 9th version, Lab. Comp. Sci., MIT, 1977.
	Moses71	Joel Moses, Algebraic simplification: a guide for the perplexed, Communications of the ACM, v.14 n.8, p.527-537, Aug. 1971 [doi>10.1145/362637.362648]
	REDUC83	Hearn A.C., "REDUCE User's Manual," version 3.0, The Rand Corporation, 1983.
	SMP81	Cole C.A., Wolfram S., et al., "SMP Handbook," version 1, Cal. Inst. Technol., 1981.
	Stout77	Stoutemyer D.R., "sin(x)2 + cos(x)2 = 1," Proc. of 1977 MACSYMA User's Conf., NASA CP-2012, 1977, pp. 425-433.
	vanHu83	J. A. van Hulzen, Code optimization of multivariate polynominal schemes: A pragmatic approach, Proceedings of the European Computer Algebra Conference on Computer Algebra, p.286-300, March 28-30, 1983