Moment subset sums over finite fields
Number Theory
2019-10-22 v2
Abstract
The -subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is the higher -th moment -subset sum problem over finite fields. We show that there is a deterministic polynomial time algorithm for the -th moment -subset sum problem over finite fields for each fixed when the evaluation set is the image set of a monomial or Dickson polynomial of any degree . In the classical case , this recovers previous findings.
Cite
@article{arxiv.1910.05894,
title = {Moment subset sums over finite fields},
author = {Tim Lai and Alicia Marino and Angela Robinson and Daqing Wan},
journal= {arXiv preprint arXiv:1910.05894},
year = {2019}
}
Comments
Added a clarifying remark in section 3, two new references, corrected a few typos