1379 search results - page 51 / 276 » The Complexity of the Annihilating Polynomial |
109
Voted
JSC
2008
15 years 15 days ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
103
Voted
FOCM
2007
15 years 14 days ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
163
click to vote
CASC
2011
Springer
14 years 15 days ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
103
Voted
ISSAC
2009
Springer
15 years 7 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...
102
Voted
ECML
2004
Springer
15 years 6 months ago
2004
Springer
Regression methods aim at inducing models of numeric data. While most state-of-the-art machine learning methods for regression focus on inducing piecewise regression models (regres...