3 search results - page 1 / 1 » The Complexity of Inversion of Explicit Goldreich's Function... |
CSR
2011
Springer
12 years 8 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...
COCO
2009
Springer
13 years 11 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...
AFRIGRAPH
2010
ACM
13 years 8 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...