Towards factoring bivariate approximate polynomials
From MaRDI portal
Recommendations
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Complexity issues in bivariate polynomial factorization
- scientific article; zbMATH DE number 962291
- Approximate factorization of multivariate polynomials via differential equations
- Approximate factorization of multidimensional polynomials depending on a parameter
- Multi-modular approach to polynomial-time factorization of bivariate integral polynomials
- scientific article; zbMATH DE number 966297
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- scientific article; zbMATH DE number 800174
- Factoring bivariate sparse (lacunary) polynomials
Cited in
(34)- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Analysis of approximate factorization algorithm. I
- Obtaining exact interpolation multivariate polynomial by approximation
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- Numerical polynomial reparametrization of rational curves
- The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain
- A symbolic-numeric approach for parametrizing ruled surfaces
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- Rational Hausdorff divisors: a new approach to the approximate parametrization of curves
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- From an approximate to an exact absolute polynomial factorization
- Obtaining exact value by approximate computations
- Approximate factorization of multivariate polynomials using singular value decomposition
- Distance bounds of \(\varepsilon\)-points on hypersurfaces
- Parametrization of approximate algebraic surfaces by lines
- The approximate irreducible factorization of a univariate polynomial. Revisited
- Approximate multivariate polynomial factorization based on zero-sum relations
- Exact polynomial factorization by approximate high degree algebraic numbers
- Approximate factorization of polynomials over Z
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Computing approximate GCD of multivariate polynomials
- Pseudofactors of multivariate polynomials
- Regularization and matrix computation in numerical polynomial algebra
- Numerical proper reparametrization of parametric plane curves
- Approximate factorization of multivariate polynomials via differential equations
- scientific article; zbMATH DE number 2151235 (Why is no real title available?)
- scientific article; zbMATH DE number 1859220 (Why is no real title available?)
- scientific article; zbMATH DE number 800174 (Why is no real title available?)
- The numerical factorization of polynomials
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
- Parametrization of approximate algebraic curves by lines
- Numerical factorization of multivariate complex polynomials
- Approximate parametrization of plane algebraic curves by linear systems of curves
- Computing monodromy via continuation methods on random Riemann surfaces
This page was built for publication: Towards factoring bivariate approximate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958917)
