An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation

DOI10.1016/j.jsc.2007.10.011zbMath1134.11045OpenAlexW2018425753MaRDI QIDQ2482628

Fatima K. Abu Salem

Publication date: 23 April 2008

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2007.10.011

zbMATH Keywords

finite fieldsNewton polytopesfactorisationbivariate polynomialssparse polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Nonlinear algebraic or transcendental equations (65H99)

Related Items (5)

Sparse bivariate polynomial factorization ⋮ Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients ⋮ An empirical study of cache-oblivious polygon indecomposability testing ⋮ Parallel methods for absolute irreducibility testing ⋮ Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Factoring multivariate polynomials over finite fields
• Factoring sparse multivariate polynomials
• On fast multiplication of polynomials over arbitrary algebras
• Factoring multivariate integral polynomials
• On the computational power of pushdown automata
• An efficient algorithm for determining the convex hull of a finite planar set
• Hensel lifting and bivariate polynomial factorisation over finite fields
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Multivariate Polynomial Factorization
• Factoring Multivariate Polynomials Over the Integers
• An Improved Multivariate Polynomial Factoring Algorithm
• Computational Geometry in C
• Factoring polynomials via polytopes
• Complexity issues in bivariate polynomial factorization
• Factoring multivariate polynomials via partial differential equations
• Absolute irreducibility of polynomials via Newton polytopes
• Decomposition of polytopes and polynomials

This page was built for publication: An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation