12 search results - page 2 / 3 » Upper Bounds on Algebraic Immunity of Boolean Power Function... |
143
click to vote
CRYPTO
2000
Springer
15 years 8 months ago
2000
Springer
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
140
click to vote
STOC
1993
ACM
15 years 8 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
144
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
167
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
135
Voted
PVLDB
2008
15 years 3 months ago
2008
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...