29908 search results - page 562 / 5982 » On the Complexity of |
182
click to vote
FSTTCS
2003
Springer
16 years 13 days ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
188
click to vote
ICALP
2003
Springer
16 years 13 days ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
187
click to vote
ICALP
2003
Springer
16 years 13 days ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...