Factoring Sparse Bivariate Polynomials Using the Priority Queue

DOI10.1007/978-3-319-10515-4_28zbMATH Open1416.68222OpenAlexW124383974MaRDI QIDQ2879344

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

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

algorithmsNewton polytopeperformance evaluationdata structuresdata localityHensel liftingbivariate polynomial factorisation

Mathematics Subject Classification ID

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

Related Items (1)

The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization

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)