Factoring bivariate lacunary polynomials without heights

DOI10.1145/2465506.2465932zbMath1360.68926arXiv1206.4224OpenAlexW1972473080MaRDI QIDQ2963227

Arkadev Chattopadhyay, Natacha Portier, Bruno Grenet, Yann Strozecki, Pascal Koiran

Publication date: 10 February 2017

Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

finite fieldspolynomial factorizationbivariate polynomialspolynomial-time complexityWronskian determinantlacunary polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (5)

Bounded-degree factors of lacunary multivariate polynomials ⋮ Lacunaryx ⋮ Sparse bivariate polynomial factorization ⋮ Computing the multilinear factors of lacunary polynomials without heights ⋮ Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots

This page was built for publication: Factoring bivariate lacunary polynomials without heights