129 search results - page 9 / 26 » Lower Bounds for Testing Triangle-freeness in Boolean Functi... |
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
DAGSTUHL
2006
13 years 9 months ago
2006
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
STOC
1999
ACM
13 years 12 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
CRYPTO
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. This paper investigates the design of S-boxes used for combining linear feedback shift register (LFSR) sequences in combination generators. Such combination generators ha...