Sciweavers

15 search results - page 2 / 3
» issac 2001
Sort
View
ISSAC
2001
Springer
98views Mathematics» more  ISSAC 2001»
13 years 12 months ago
Towards factoring bivariate approximate polynomials
Robert M. Corless, Mark Giesbrecht, Mark van Hoeij...
ISSAC
2001
Springer
133views Mathematics» more  ISSAC 2001»
13 years 12 months ago
Irreducible trinomials over finite fields
A necessary condition for irreducibility of a trinomial over a finite field, based on classical results of Stickelberger and Swan, is established. It is applied in the special ca...
Joachim von zur Gathen
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
13 years 12 months ago
On computational properties of chains of recurrences
Backward and mixed chains of recurrences are introduced. A complete set of chains of recurrences manipulation tools is described. Applications of these tools, related to the safet...
Eugene V. Zima
ISSAC
2001
Springer
119views Mathematics» more  ISSAC 2001»
13 years 12 months ago
Algorithms for trigonometric polynomials
In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonomet...
Jamie Mulholland, Michael B. Monagan
ISSAC
2001
Springer
101views Mathematics» more  ISSAC 2001»
13 years 12 months ago
Maple's evaluation process as constraint contextual rewriting
Maple’s evaluator, together with a feature that is usually known as the assume facility, is a combination of modules with specialised reasoning capabilities. These modules are i...
Alessandro Armando, Clemens Ballarin