4255 search results - page 106 / 851 » On Learning Boolean Functions |
STOC
1992
ACM
15 years 1 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
ICISC
2004
14 years 11 months ago
2004
Algebraic attacks on stream ciphers [14] recover the key by solving an overdefined system of multivariate equations. Such attacks can break several interesting cases of LFSR-based ...
CORR
2008
Springer
14 years 10 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
14 years 10 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
14 years 10 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...