1986Unpublished venueRequires access

Simplification of algebraic expression by multiterm rewriting rules

Tateaki Sasaki

Open publisher page 1 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Rewriting, Simple (philosophy), Algebraic number, Expression (computer science), Algebraic expression, Computer science, Algorithm, Algebra over a field

Related papers

Back to paper searchBrowse research topicsOriginal source
Simplification of algebraic expression by multiterm rewriting rules — Research Paper | ScholarLens