6142 search results - page 38 / 1229 » The Complexity of Partition Functions |
DAGSTUHL
2006
14 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
14 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
15 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...
TAPSOFT
1997
Springer
15 years 1 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
PROMISE
2010
14 years 4 months ago
2010
Background. Currently there are several definitions of measures that should represent the size of software functional requirements. These measures have gained a quite relevant rol...