1469 search results - page 6 / 294 » Approximate polynomial decomposition |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
FOCS
2003
IEEE
14 years 4 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
CASC
2006
Springer
14 years 2 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...
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
FCSC
2008
13 years 11 months ago
2008
Abstract. We discuss the verification of mathematical software solving polynomial systems symbolically by way of triangular decomposition. Standard verification techniques are high...