4255 search results - page 22 / 851 » On Learning 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 ...
EUROCRYPT
1991
Springer
13 years 11 months ago
1991
Springer
Boolean functions that satisfy higher order propagation criteria are studied. A complete characterization is given of the autocorrelation function and Walsh spectrum of second ord...
ICCAD
1996
IEEE
13 years 12 months ago
1996
IEEE
This paper describes an algorithm for the efficient solution of large systems of Boolean equations. The algorithm exploits the fact that, in some cases, the composition operation ...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...