1278 search results - page 32 / 256 » The Complexity of Weighted Boolean |
ENTCS
2006
13 years 7 months ago
2006
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
BMCBI
2010
13 years 7 months ago
2010
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
JAIR
2006
13 years 7 months ago
2006
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
SCFBM
2008
13 years 7 months ago
2008
Modern life sciences research increasingly relies on computational solutions, from large scale data analyses to theoretical modeling. Within the theoretical models Boolean network...