1278 search results - page 1 / 256 » The Complexity of Weighted Boolean |
DAGSTUHL
2006
13 years 6 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
CORR
2008
Springer
13 years 3 months ago
2008
Springer
CORR
2007
Springer
13 years 4 months ago
2007
Springer
CIE
2010
Springer
13 years 9 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 ...
CDES
2008
13 years 6 months ago
2008
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...