707 search results - page 112 / 142 » The Nonhomomorphicity of Boolean Functions |
152
Voted
SPIRE
2010
Springer
15 years 1 months ago
2010
Springer
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
144
Voted
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
155
Voted
EOR
2011
14 years 10 months ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
115
Voted
MFCS
1998
Springer
15 years 7 months ago
1998
Springer
In this paper we consider the problem of characterizing optimal variable orderings for shared OBDDs of two Boolean functions fi = gi i hi, i = 1, 2, where i is an operator from th...
123
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...