2168 search results - page 129 / 434 » Randomized Algorithms and Complexity Theory |
119
Voted
COCO
2003
Springer
15 years 8 months 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} ...
138
Voted
DCG
2008
15 years 3 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by m...
138
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
135
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...