3415 search results - page 559 / 683 » Lower Bounds for Kernelizations |
134
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
127
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
138
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always w...
154
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
149
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...