Semi-numerical absolute factorization of polynomials with integer coefficients
From MaRDI portal
Publication:2643526
DOI10.1016/S0747-7171(02)00011-1zbMATH Open1137.13314MaRDI QIDQ2643526FDOQ2643526
Authors: David Rupprecht 
Publication date: 24 August 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Recommendations
Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effective Noether irreducibility forms and applications
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Title not available (Why is that?)
- Fast parallel absolute irreducibility testing
- Absolute Factorization of Polynomials: A Geometric Approach
- 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
- Title not available (Why is that?)
- Lifting and recombination techniques for absolute factorization
- From an approximate to an exact absolute polynomial factorization
- Foreword. What is numerical algebraic geometry?
- Title not available (Why is that?)
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)
