Complexity issues in bivariate polynomial factorization
From MaRDI portal
Publication:4657300
DOI10.1145/1005285.1005294zbMath1134.68595MaRDI QIDQ4657300
Grégoire Lecerf, Bruno Salvy, Éric Schost, Alin Bostan, B. Wiebelt
Publication date: 14 March 2005
Published in: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1005285.1005294
68W40: Analysis of algorithms
68W30: Symbolic computation and algebraic computation
13P05: Polynomials, factorization in commutative rings
Related Items
Modular Las Vegas algorithms for polynomial absolute factorization, A lifting and recombination algorithm for rational factorization of sparse polynomials, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Towards toric absolute factorization, Factoring polynomials over global fields, Lifting and recombination techniques for absolute factorization, A concise proof of the Kronecker polynomial system solver from scratch, 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, Sharp precision in Hensel lifting for bivariate polynomial factorization
Uses Software
