activity
20042025
most citedGeneric exponential sums associated to Laurent polynomials in one variable

10 citations · 28 across the 30 of their papers we have counts for

collaborators
Showing cs.GTShow all

1 paper · 1 filter

cs.GT2024

An NP-hard generalization of Nim

Chunlei Liu

A new combinatorial game is given. It generalizes both Substraction and Nim. It is proved the computation of Nash equilibrium points in this new game is NP-hard.