1410 search results - page 267 / 282 » Proving theorems by reuse |
147
click to vote
STACS
2010
Springer
16 years 22 days 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...
162
click to vote
ISBRA
2009
Springer
16 years 16 days ago
2009
Springer
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...
191
click to vote
COCO
2009
Springer
16 years 10 days ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
159
click to vote
COCO
2009
Springer
16 years 10 days ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
157
click to vote
IMA
2009
Springer
16 years 9 days ago
2009
Springer
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...