Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree

DOI10.1145/3365667zbMath1491.68273arXiv1808.06655OpenAlexW3021415944MaRDI 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

zbMATH Keywords

sparse polynomialsmultivariate polynomial factorizationbounds on factor sparsity

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items (2)

Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ New Sparse Multivariate Polynomial Factorization Algorithms over Integers

This page was built for publication: Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree