Sciweavers

29 search results - page 2 / 6
» On integer values of Kloosterman sums
Sort
View
MOC
2002
73views more  MOC 2002»
13 years 7 months ago
Evaluation of zeta function of the simplest cubic field at negative odd integers
Abstract. In this paper, we are interested in the evaluation of the zeta function of the simplest cubic field. We first introduce Siegel's formula for values of the zeta funct...
Hyun Kwang Kim, Jung Soo Kim
ACG
2009
Springer
14 years 2 months ago
Monte-Carlo Kakuro
Abstract. Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in ...
Tristan Cazenave
ICALP
1998
Springer
13 years 12 months ago
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
Cristina Bazgan, Miklos Santha, Zsolt Tuza
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
14 years 8 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
CANDC
2005
ACM
13 years 7 months ago
Integer linear programming as a tool for constructing trees from quartet data
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
Jan Weyer-Menkhoff, Claudine Devauchelle, Alexande...