Deterministic poly-time and quasipoly-time algorithms list all bounded individual-degree factors of sparse polynomials (with possible spurious outputs) and yield a new upper bound on their number.
Rai, Varun Ramanathan, Ramprasad Saptharishi, and Shubhangi Saraf
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials
Deterministic poly-time and quasipoly-time algorithms list all bounded individual-degree factors of sparse polynomials (with possible spurious outputs) and yield a new upper bound on their number.