41 search results - page 2 / 9 » On the Construction of One-Way Functions from Average Case H... |
CC
2005
Springer
13 years 4 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
JC
2008
13 years 4 months ago
2008
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
COCO
2003
Springer
13 years 10 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} ...
PODS
2007
ACM
14 years 5 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...