3898 search results - page 169 / 780 » On the Bit Extraction Problem |
176
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
121
click to vote
TCC
2007
Springer
15 years 9 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
103
click to vote
CAL
2004
15 years 2 months ago
2004
Wires shrink less efficiently than transistors. Smaller dimensions increase relative delay and the probability of crosstalk. Solutions to this problem include adding additional lat...
122
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...
126
click to vote
PKC
2009
Springer
16 years 3 months ago
2009
Springer
We address the problem of polynomial time factoring RSA moduli N1 = p1q1 with the help of an oracle. As opposed to other approaches that require an oracle that explicitly outputs b...