Within the last year
Within the past 3 years
1 - 5 of 5 articles
In recent work 1213, Plaisted has considered the computational complexity of certain decision problems for sparse polynomials. The present expository paper is intended to make these results accessible to those working in the area of algebraic manipulation and to clarify the relevance of the...
Archimedes' problem for his colleagues in Alexandria, as stated in this Bulletin 1, amounts to solving the system (1)-(9) for positive integers W, X, Y, Z and w, x, y, z.
Algorithm for simplifying locally non nested radicals is suggested. The main albegraic operations needed are "GCD's" and solution of Diophantine equations over the integers.
This paper is a preliminary report on the design and implementation of a mode-based symbolic programming system and compiler which allows programming with rewrite rules and let and is pattern-match constructs. An important feature of this design is the provision for mode-valued variables which...
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don't already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don't already have one.
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don't already have one.