707 search results - page 92 / 142 » The Nonhomomorphicity of Boolean Functions |
89
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
139
click to vote
ENTCS
2010
15 years 25 days ago
2010
s as an Abstract Domain Jacob M. Howe1,4 Dept of Computing, City University London, UK Andy King1,3,5 School of Computing, University of Kent, Canterbury, UK Charles Lawrence-Jones...
118
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
125
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
144
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functiona...