129 search results - page 2 / 26 » Lower Bounds for Testing Triangle-freeness in Boolean Functi... |
IACR
2011
12 years 5 months ago
2011
Abstract. In this paper we find a lower bound of the second-order nonlinearities of Boolean bent functions of the form f(x) = Trn 1 (α1xd1 + α2xd2 ), where d1 and d2 are Niho ex...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
ECCC
2010
13 years 3 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
COCO
1999
Springer
13 years 9 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
CIE
2010
Springer
13 years 10 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...