105 search results - page 1 / 21 » On the subset sum problem over finite fields |
FFA
2008
13 years 4 months ago
2008
Abstract. The subset sum problem over finite fields is a well known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study th...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]
FFA
2008
13 years 4 months ago
2008
Let k be a finite field with q elements. Let kn be the extension of k with degree n. Let Nn be the kernel of the norm map Nkn/k : k
STACS
2005
Springer
13 years 10 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
AAECC
1993
Springer
13 years 8 months ago
1993
Springer
We give estimates for exponential sums over finite fields in several variables. We study the case where the phase is either quadratic or more generally invariant under the action ...