Výsledky vyhledávání - "Theory of computation- Algebraic complexity theory"
-
1
On Solving Sparse Polynomial Factorization Related Problems
ISSN: 1016-3328, 1420-8954Vydáno: Cham Springer International Publishing 01.06.2025Vydáno v Computational complexity (01.06.2025)“…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…”
Získat plný text
Journal Article