Tim Lai,Alicia Marino,Angela Robinson et al.
Tim Lai et al.
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 deter...
Robert W. Fitzgerald; Joseph L. Yucas
Robert W. Fitzgerald; Joseph L. Yucas
Régis Blache
Régis Blache
A generalization of the Hansen–Mullen conjecture on irreducible polynomials over finite fields [0.03%]
有限域上不可约多项式的Hansen-Mullen猜想的推广
Daniel Panario; Georgios Tzanakis
Daniel Panario; Georgios Tzanakis
Chong Jie Lim
Chong Jie Lim
Christophe Negre
Christophe Negre
Sunghyu Han; Jon-Lark Kim; Heisook Lee; Yoonjin Lee
Sunghyu Han; Jon-Lark Kim; Heisook Lee; Yoonjin Lee
Zhenhua Gu; Zhe-Xian Wan
Zhenhua Gu; Zhe-Xian Wan