Factoring sparse bivariate polynomials using the priority queue

DOI10.1007/978-3-319-10515-4_28MaRDI QIDQ2879344zbMATH OpenOpenAlexFDO

Authors Fatima K. Abu Salem, Khalil El-Harake, Karl Gemayel

Publication date 8 September 2014

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10515-4_28

zbMATH Keywords

algorithmsbivariate polynomial factorisationdata localitydata structuresHensel liftingNewton polytopeperformance evaluation

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
• Factoring polynomials via polytopes
• Sparse bivariate polynomial factorization
• Sparse multivariate Hensel lifting: a high-performance design and implementation
• The complexity of sparse Hensel lifting and sparse polynomial factorization

Cited in

(2)

• The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation

This page was built for publication: Factoring sparse bivariate polynomials using the priority queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879344)