Ruichen Qiu

This paper proves that output-sensitive sparse polynomial GCD computation over finite fields is NP-hard.

The paper shows that deciding whether a sparse polynomial does not divide another sparse polynomial exactly over finite fields is NP-hard.

The authors provide a counterexample to a previously claimed solution to the open problem of quasi-linear time output-sensitive sparse polynomial multiplication for integer coefficients.

The paper presents Numina Fuse, an agent-native application for formalizing mathematics in Lean 4, and its development and use in formalizing the three-dimensional Kakeya conjecture.