Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
From MaRDI portal
algorithm analysisHensel lemmaHilbert irreducibility theoremintegral polynomialmultivariate polynomialspolynomial factorizationpolynomial-time complexity
Polynomials (irreducibility, etc.) (11R09) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Computational methods for problems pertaining to field theory (12-08) Polynomials in real and complex fields: factorization (12D05) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(52)- Parallel methods for absolute irreducibility testing
- Factoring sparse multivariate polynomials
- Fast parallel absolute irreducibility testing
- Irreducibility of multivariate polynomials
- Computer algebra: Past and future
- Sentences over integral domains and their computational complexities
- Approximate solutions of polynomial equations.
- Computing the irreducible real factors and components of an algebraic curve
- Deterministic irreducibility testing of polynomials over large finite fields
- Computing a context-free grammar-generating series
- Efficient q-integer linear decomposition of multivariate polynomials
- Heuristics to sift extraneous factors in Dixon resultants
- Computation of étale cohomology on curves in single exponential time
- Time-bounded termination analysis for probabilistic programs with delays
- Computing the multilinear factors of lacunary polynomials without heights
- Complexity of solving parametric polynomial systems
- A conflict-driven solving procedure for poly-power constraints
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- Improved dense multivariate polynomial factorization algorithms
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Deterministic distinct-degree factorization of polynomials over finite fields
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
- Factors of low individual degree polynomials
- scientific article; zbMATH DE number 1309684 (Why is no real title available?)
- Sparse bivariate polynomial factorization
- Factoring multivariate polynomials via partial differential equations
- Random arithmetic formulas can be reconstructed efficiently
- On learning linear functions from subset and its applications in quantum computing
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
- The numerical factorization of polynomials
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Rational solutions of Riccati-like partial differential equations
- Real factorization of multivariate polynomials with integer coefficients
- Deformation techniques to solve generalised Pham systems
- An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
- New Sparse Multivariate Polynomial Factorization Algorithms over Integers
- A note on Gao's algorithm for polynomial factorization
- New absolute irreducibility testing criteria and factorization of multivariate polynomials
- A new absolute irreducibility criterion for multivariate polynomials over finite fields
- Derandomizing multivariate polynomial factoring for low degree factors
- Factoring sparse polynomials fast
- Proximity gaps for Reed-Solomon codes
- Encounters in symbolic computation: ideas for the ages
- Complexity of factoring and calculating the GCD of linear ordinary differential operators
- Algorithms for near solutions to polynomial equations
- Factoring bivariate sparse (lacunary) polynomials
- On computing the intersection of a pair of algebraic surfaces
- Interpolating polynomials from their values
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Computational complexity of sentences over fields
- An empirical study of cache-oblivious polygon indecomposability testing
This page was built for publication: Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3743372)
