1450 search results - page 66 / 290 » On the Complexity of Hardness Amplification |
248
click to vote
GMP
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
145
click to vote
RTSS
2009
IEEE
16 years 27 days ago
2009
IEEE
In complex hard real-time systems with tight constraints on system resources, small changes in one component of a system can cause a cascade of adverse effects on other parts of t...
183
click to vote
INDOCRYPT
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a family of cryptographic hash functions. The security claim of the FSB hashes is based on a coding theory pro...
167
click to vote
COCO
2001
Springer
15 years 10 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
166
click to vote
WSC
2007
15 years 8 months ago
2007
Semiconductor wafer fabrication facilities (wafer fabs) are among the most complex production facilities. A large product variety, hundreds of processing steps per product, hundre...