725 search results - page 4 / 145 » Bounding Degrees on RPL |
TIT
2011
14 years 8 months ago
2011
—Secure communication protocols over a single-relay system in the presence of a multiple-antenna eavesdropper are investigated. When there is no direct link between the source an...
115
click to vote
COCO
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
JSYML
2007
15 years 1 months ago
2007
We show that every nonzero Σ0 2 enumeration degree bounds a nonsplitting nonzero enumeration degree.
181
click to vote
CC
2010
Springer
14 years 7 months ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
112
click to vote
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...