Ruyong Feng
2 indexed papers
Recent (6 mo)
2With code
0Influential cites
0Benchmarked
0Publications per year
226
Top categories
Symbolic×2Complexity×2
Frequent co-authors
Research Timeline
2026
Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard
This paper proves that output-sensitive sparse polynomial GCD computation over finite fields is NP-hard.
Sparse Polynomial Divisibility Test over Finite Field is CoNP-hard
The paper shows that deciding whether a sparse polynomial does not divide another sparse polynomial exactly over finite fields is NP-hard.
Highlighted terms show continued research focus across papers
Papers
cs.SCcs.CCTheoreticalRecentJun 10, 2026
Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard
Ruichen Qiu, Yichuan Cao, Qiao-Long Huang, Ruyong Feng +1 more
This paper proves that output-sensitive sparse polynomial GCD computation over finite fields is NP-hard.
View →
cs.SCcs.CCTheoreticalRecent