February 1, 2020
Author(s)
Tim LAI, Alicia Marino, Angela Robinson, Daqing Wan
The k-subset sum problem over finite fields is a classical NP-complete problem. Motivated by coding theory applications, a more complex problem is the higher m-th moment k-subset sum problem over finite fields. We show that there is a deterministic