3 search results - page 1 / 1 » The Complexity of Inversion of Explicit Goldreich's Function... |
134
click to vote
CSR
2011
Springer
14 years 3 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
124
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
119
click to vote
AFRIGRAPH
2010
ACM
15 years 2 months ago
2010
ACM
Interpolation based on Radial Basis Functions (RBF) is very often used for scattered scalar data interpolation in n-dimensional space in general. RBFs are used for surface reconst...