Sparse polynomial divisibility test over finite fields is CoNP-hard under BPP reductions, resolving an open complexity question.
Maurice Rojas
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.