Sciweavers

1278 search results - page 34 / 256
» The Complexity of Weighted Boolean
Sort
View
ISMVL
2009
IEEE
78views Hardware» more  ISMVL 2009»
14 years 2 months ago
Frozen Boolean Partial Co-clones
We introduce and investigate the concept of frozen partial co-clones. Our main motivation for studying frozen partial co-clones is that they have important applications in complex...
Gustav Nordh, Bruno Zanuttini
AB
2008
Springer
14 years 2 months ago
Algorithms for Inference, Analysis and Control of Boolean Networks
Boolean networks (BNs) are known as a mathematical model of genetic networks. In this paper, we overview algorithmic aspects of inference, analysis and control of BNs while focusin...
Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamur...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 8 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
JAR
2006
236views more  JAR 2006»
13 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 7 months ago
Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
Nuno P. Lopes, Levent Aksoy, Vasco M. Manquinho, J...