467 search results - page 21 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
103
click to vote
COCO
2001
Springer
15 years 4 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
IANDC
2006
14 years 11 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
GLOBECOM
2009
IEEE
15 years 3 months ago
2009
IEEE
A new method is proposed for the blind subspace-based identification of the coefficients of time-varying (TV) single-input multiple-output (SIMO) FIR channels. The TV channel coef...
WSCG
2004
15 years 1 months ago
2004
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming th...