Output-sensitive sparse polynomial GCD over finite fields is NP-hard under BPP many-one reduction, settling Challenge 5 from the Sparsity Challenges.
Title resolution pending
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
-
Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard
Output-sensitive sparse polynomial GCD over finite fields is NP-hard under BPP many-one reduction, settling Challenge 5 from the Sparsity Challenges.