Sparse polynomial divisibility test over finite fields is CoNP-hard under BPP reductions, resolving an open complexity question.
Sumsets, 3sum, subset sum: Now for real! InProceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.SC 2years
2026 2verdicts
UNVERDICTED 2representative 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.
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.