10054 search results - page 144 / 2011 » On the Complexity of Function Learning |
100
click to vote
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
117
click to vote
STOC
1996
ACM
15 years 7 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...