1278 search results - page 46 / 256 » The Complexity of Weighted Boolean |
CIBCB
2005
IEEE
14 years 1 months ago
2005
IEEE
We analyse a suite of Boolean networks which have been evolved to exhibit limit cycle-type dynamics in terms of the distribution of small network motifs and feedback loops. We find...
SAS
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
FSE
2006
Springer
13 years 11 months ago
2006
Springer
The purpose of algebraic attacks on stream and block ciphers is to recover the secret key by solving an overdefined system of multivariate algebraic equations. They become very eff...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
JCSS
2008
13 years 7 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...