105 search results - page 2 / 21 » On the subset sum problem over finite fields |
TIT
2010
13 years 3 days ago
2010
Abstract. In this note we use Carlitz's lifting formula for Kloosterman sums and some results from the theory of cyclotomic fields to show that a Kloosterman sum over a finite...
JCT
2010
13 years 6 days ago
2010
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
AAECC
2005
Springer
13 years 5 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
MOC
1998
13 years 5 months ago
1998
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we ...
TSP
2008
13 years 5 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...