On Solving Sparse Polynomial Factorization Related Problems

In a recent result of Bhargava, Saraf and Volkovich [FOCS’18; JACM’20], the first factor sparsity bound for constant individual degree polynomials was shown. In particular, it was shown that any factor of a polynomial with at most s terms and individual degree bounded by d can itself have at most s...

Full description

Bibliographic Details

Published in:	Computational complexity Vol. 34; no. 1; p. 7
Main Authors:	Bisht, Pranav, Volkovich, Ilya
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.06.2025 Springer Nature B.V
Subjects:	Algebra Algorithm Analysis and Problem Complexity Algorithms Circuits Computational Mathematics and Numerical Analysis Computer Science Polynomials Sparsity Multivariate Polynomial Factorization Identity Testing Pseudorandomness and derandomization Factor Sparsity Theory of computation- Algebraic complexity theory Sparse Polynomials Derandomization
ISSN:	1016-3328, 1420-8954
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!