1469 search results - page 11 / 294 » Approximate polynomial decomposition |
AAECC
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
VISUALIZATION
1995
IEEE
15 years 1 months ago
1995
IEEE
Wavelet transforms include data decompositions and reconstructions. This paper is concerned with the authenticity issues of the data decomposition, particularly for data visualiza...
72
Voted
ISSAC
2007
Springer
15 years 3 months ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
TCS
2008
14 years 9 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...