Semi-numerical absolute factorization of polynomials with integer coefficients
From MaRDI portal
Publication:2643526
Recommendations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3732219 (Why is no real title available?)
- scientific article; zbMATH DE number 3554399 (Why is no real title available?)
- scientific article; zbMATH DE number 1253987 (Why is no real title available?)
- scientific article; zbMATH DE number 481965 (Why is no real title available?)
- Absolute Factorization of Polynomials: A Geometric Approach
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Effective Noether irreducibility forms and applications
- Fast parallel absolute irreducibility testing
- Massively parallel search for linear factors in polynomials with many variables
Cited in
(12)- Numerical factorization of multivariate complex polynomials
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Reducing factorization of a semiprime number to the integration of highly oscillatory functions
- Four lectures on polynomial absolute factorization
- Towards toric absolute factorization
- Modular Las Vegas algorithms for polynomial absolute factorization
- Approximate factorization of multivariate polynomials using singular value decomposition
- scientific article; zbMATH DE number 1262457 (Why is no real title available?)
- Lifting and recombination techniques for absolute factorization
- From an approximate to an exact absolute polynomial factorization
- Foreword. What is numerical algebraic geometry?
- scientific article; zbMATH DE number 2151216 (Why is no real title available?)
This page was built for publication: Semi-numerical absolute factorization of polynomials with integer coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643526)