1450 search results - page 66 / 290 » On the Complexity of Hardness Amplification |
GMP
2010
IEEE
13 years 9 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 ...
RTSS
2009
IEEE
14 years 3 months 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...
INDOCRYPT
2007
Springer
14 years 3 months 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...
COCO
2001
Springer
14 years 1 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 ...
WSC
2007
13 years 11 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...