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...

Celý popis

Podrobná bibliografie

Vydáno v:	Computational complexity Ročník 34; číslo 1; s. 7
Hlavní autoři:	Bisht, Pranav, Volkovich, Ilya
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cham Springer International Publishing 01.06.2025 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!