1450 search results - page 21 / 290 » On the Complexity of Hardness Amplification |
PODC
2012
ACM
11 years 10 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
COCO
2003
Springer
14 years 27 days ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
AAAI
2006
13 years 9 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
HIPC
2003
Springer
14 years 26 days ago
2003
Springer
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...