374 search results - page 8 / 75 » sum 2010 |
ENDM
2007
13 years 9 months ago
2007
We show that the number of maximal sum-free subsets of {1, 2, . . . , n} is at most 23n/8+o(n) . We also show that 20.406n+o(n) is an upper bound on the number of maximal product-...
DAM
2010
13 years 10 months ago
2010
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
TCC
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
SODA
2010
ACM
13 years 8 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
MA
2010
Springer
13 years 8 months ago
2010
Springer
We describe several analytical and numerical procedures to obtain bounds on the distribution function of a sum of n dependent risks having fixed overlapping marginals. As an appl...