10054 search results - page 47 / 2011 » On the Complexity of Function Learning |
TSMC
1998
13 years 9 months ago
1998
— The complexity of a design process or a design artifact substantially influences their performance. When evaluation of terms such as “design complexity” and its “quality...
IPL
2010
13 years 8 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
DAGSTUHL
2006
13 years 11 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
IPL
2000
13 years 9 months ago
2000
We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of t...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...