29 search results - page 1 / 6 » On integer values of Kloosterman sums |
TIT
2010
13 years 2 months 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...
DM
1999
13 years 7 months ago
1999
For an arbitrary subset P of the reals, we define a function f: V P to be a Pdominating function of graph G = (V, E) if the sum of the function values over any
CIE
2010
Springer
13 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
WADS
2001
Springer
14 years 2 days ago
2001
Springer
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...