706 search results - page 81 / 142 » On a quasi-ordering on Boolean functions |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
ECCC
2010
13 years 9 months ago
2010
Abstract--There has been a sequence of recent papers devoted to understanding the relation between the testability of properties of Boolean functions and the invariance of the prop...
APPML
2006
13 years 9 months ago
2006
We obtain an upper bound on a new type of exponential sums with linear recurrence sequences. We apply this bound to estimate the Fourier coefficients, and thus the nonlinearity, o...
COLT
1999
Springer
14 years 1 months ago
1999
Springer
In this paper we analyze the PAC learning abilities of several simple iterative algorithms for learning linear threshold functions, obtaining both positive and negative results. W...
CHES
2004
Springer
14 years 2 months ago
2004
Springer
Cryptographic algorithms implemented on smart-cards must be protected against side-channel attacks. Some encryption schemes and hash functions like IDEA, RC6, MD5, SHA-1 alternate ...