16 search results - page 2 / 4 » Algorithms for the Functional Decomposition of Laurent Polyn... |
ISSAC
2009
Springer
13 years 12 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...
COMBINATORICS
2004
13 years 5 months ago
2004
This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immed...
CASES
2004
ACM
13 years 10 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
TNN
2008
13 years 5 months ago
2008
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
ISSAC
2009
Springer
13 years 12 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...