3415 search results - page 533 / 683 » Lower Bounds for Kernelizations |
128
click to vote
VTC
2007
IEEE
15 years 10 months ago
2007
IEEE
—This paper presents an opportunistic feedback (OF) protocol that achieves the asymptotic sum-capacity of the fading broadcast channel (BC) with a limited amount of feedback. The...
129
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
116
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
160
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
136
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...