707 search results - page 7 / 142 » The Nonhomomorphicity of Boolean Functions |
TCS
2002
13 years 7 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. ...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
BIRTHDAY
2004
Springer
13 years 11 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
IPL
2010
13 years 6 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we characterize (octal) bent generalized Boolean functions defined on Zn 2 with values in Z8. Moreover, we propose several constructions of such generalized bent fun...