4255 search results - page 188 / 851 » On Learning Boolean Functions |
160
click to vote
FSE
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
193
click to vote
ENTCS
2006
15 years 6 months ago
2006
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
158
click to vote
IACR
2011
14 years 6 months ago
2011
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
159
click to vote
ALT
2000
Springer
15 years 10 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
162
click to vote
NIPS
2008
15 years 8 months ago
2008
We propose a general method called truncated gradient to induce sparsity in the weights of onlinelearning algorithms with convex loss functions. This method has several essential ...