Sparse polynomial divisibility test over finite fields is CoNP-hard under BPP reductions, resolving an open complexity question.
On exact division and divisibility testing for sparse polynomials
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Disproves a prior quasi-linear claim for integer sparse polynomial multiplication and supplies a quasi-linear bit-complexity algorithm via modular interpolation, plus a linear-bit algorithm over finite fields.
New bivariate range functions based on interpolation achieve cubic and quartic convergence orders for certified computations.
citing papers explorer
-
Sparse Polynomial Divisibility Test over Finite Field is CoNP-hard
Sparse polynomial divisibility test over finite fields is CoNP-hard under BPP reductions, resolving an open complexity question.
-
Quasi-linear Time Multiplication of Sparse Polynomials with Integer Coefficients
Disproves a prior quasi-linear claim for integer sparse polynomial multiplication and supplies a quasi-linear bit-complexity algorithm via modular interpolation, plus a linear-bit algorithm over finite fields.
-
Bivariate range functions with superior convergence order
New bivariate range functions based on interpolation achieve cubic and quartic convergence orders for certified computations.