Modular Las Vegas algorithms for polynomial absolute factorization

DOI10.1016/j.jsc.2010.06.010zbMath1244.12006arXiv0911.5024OpenAlexW2041439804MaRDI QIDQ607052

Cristina Bertone, Guillaume Chèze, Andre Galligo

Publication date: 19 November 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.5024

zbMATH Keywords

Newton polytopeLLL algorithmabsolute factorizationmodular computations

Mathematics Subject Classification ID

Related Items (2)

Towards van der Waerden’s conjecture ⋮ Infinitely Many Knots With NonIntegral Trace

Uses Software

• CoCoA
• Magma
• Maple
• absfact.lib

Cites Work

• Numerical factorization of multivariate complex polynomials
• Factoring polynomials and the knapsack problem
• Bounds for Hilbert's irreducibility theorem
• Factoring polynomials over global fields
• Fast parallel absolute irreducibility testing
• Factoring polynomials with rational coefficients
• On multiplication and factorization of polynomials. I: Lexicographic orderings and extreme aggregates of terms
• On the reduction modulo \(p\) of an absolutely irreducible polynomial \(f(x,y)\)
• The Magma algebra system. I: The user language
• Probabilistic absolute irreducibility test for polynomials
• Effective Noether irreducibility forms and applications
• Lifting and recombination techniques for absolute factorization
• Improved dense multivariate polynomial factorization algorithms
• Fast LLL-type lattice reduction
• Semi-numerical absolute factorization of polynomials with integer coefficients
• Sharp precision in Hensel lifting for bivariate polynomial factorization
• On the parallel Risch Algorithm (II)
• A polynomial reduction algorithm
• Complexity issues in bivariate polynomial factorization
• Factoring multivariate polynomials via partial differential equations
• Floating-Point LLL Revisited
• Absolute irreducibility of polynomials via Newton polytopes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Modular Las Vegas algorithms for polynomial absolute factorization