102 search results - page 1 / 21 » On the Complexity of Boolean Functions in Different Characte... |
COCO
2009
Springer
13 years 8 months ago
2009
Springer
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We investigate the link between the nonlinearity of a Boolean function and its propagation characteristics. We prove that highly nonlinear functions usually have good propagation p...
ICCD
2008
IEEE
14 years 1 months ago
2008
IEEE
- A gate level probabilistic error propagation model is presented which takes as input the Boolean function of the gate, the signal and error probabilities of the gate inputs, and ...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
BMCBI
2007
13 years 5 months ago
2007
Background: A number of studies on biological networks have been carried out to unravel the topological characteristics that can explain the functional importance of network nodes...