1450 search results - page 113 / 290 » On the Complexity of Hardness Amplification |
PERCOM
2010
ACM
14 years 1 months ago
2010
ACM
—Efficient discovery of nearby devices and services is one of the preconditions to obtain a usable pervasive environment. Typical user interfaces in these environments hide the ...
COCO
2006
Springer
14 years 26 days ago
2006
Springer
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
DEXA
2006
Springer
14 years 25 days ago
2006
Springer
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
EUROCRYPT
2006
Springer
14 years 24 days ago
2006
Springer
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
EVOW
2006
Springer
14 years 24 days ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...