arXiv · 1910.05894
Moment subset sums over finite fields
Abstract
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 polynomial time algorithm for the $m$-th moment $k$-subset sum problem over finite fields for each fixed $m$ when the evaluation set is the image set of a monomial or Dickson polynomial of any degree $n$. In the classical case $m=1$, this recovers previous findings.
Explore related subjects
Keep this discovery
Tim Lai, Alicia Marino, Angela Robinson, Daqing Wan. 2019-10-14. Moment subset sums over finite fields. https://arxiv.org/abs/1910.05894
Cite the original work for its findings. Save a collection to share your selection of sources.