5 search results - page 1 / 1 » On Decomposition of Tame Polynomials and Rational Functions |
CASC
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a poly...
CORR
2010
Springer
13 years 7 days ago
2010
Springer
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
ALGORITHMICA
2007
13 years 5 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
CASC
2011
Springer
12 years 5 months ago
2011
Springer
Abstract. We study continuous dynamical systems defined by autonomous ordinary differential equations, themselves given by parametric rational functions. For such systems, we pro...
JUCS
2006
13 years 5 months ago
2006
: A sequence of increasing translation invariant subspaces can be defined by the Haar-system (or generally by wavelets). The orthogonal projection to the subspaces generates a deco...