Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree
From MaRDI portal
Publication:5133964
DOI10.1145/3365667zbMath1491.68273arXiv1808.06655MaRDI QIDQ5133964
Ilya Volkovich, Vishwas Bhargava, Shubhangi Saraf
Publication date: 11 November 2020
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.06655
68W30: Symbolic computation and algebraic computation
12E05: Polynomials in general fields (irreducibility, etc.)
Related Items
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, New Sparse Multivariate Polynomial Factorization Algorithms over Integers