129 search results - page 14 / 26 » Lower Bounds for Testing Triangle-freeness in Boolean Functi... |
COCO
2011
Springer
12 years 7 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
MST
2010
13 years 6 months ago
2010
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always w...
EUROCRYPT
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. In this paper, we give some relationship between the nonlinearity of rational functions over F2n and the number of points of associated hyperelliptic curve. Using this, w...