21 search results - page 1 / 5 » On the Sensitivity of Cyclically-Invariant Boolean Functions |
COCO
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n1/3 ). This result answers two previously published questions. Tur´an (1984) asked if ...
COMBINATORICA
1998
13 years 4 months ago
1998
TCS
2002
13 years 4 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
APPROX
2011
Springer
12 years 4 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
ICCD
1996
IEEE
13 years 8 months ago
1996
IEEE
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...