1730 search results - page 239 / 346 » Algebra and Computation |
140
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
MKM
2005
Springer
15 years 9 months ago
2005
Springer
In mathematical textbooks matrices are often represented as objects of indefinite size containing abbreviations. To make the knowledge implicitly given in these representations av...
160
click to vote
ISSAC
2004
Springer
15 years 9 months ago
2004
Springer
Simplification has been long recognised to be a fundamental problem within computer algebra[17]. However, even for the class of elementary functions, it has not been resolved in ...
138
click to vote
AISC
1994
Springer
15 years 8 months ago
1994
Springer
This paper investigates some soundness conditions which have to be fulfilled in systems with coercions and generic operators. A result of Reynolds on unrestricted generic operators...
146
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...