Sciweavers

725 search results - page 4 / 145
» Bounding Degrees on RPL
Sort
View
TIT
2011
112views more  TIT 2011»
13 years 5 months ago
On the Secure Degrees of Freedom of Relaying With Half-Duplex Feedback
—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...
Thanh Tùng Kim, H. Vincent Poor
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
14 years 2 months ago
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions
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...
Daniel M. Kane
JSYML
2007
68views more  JSYML 2007»
13 years 10 months ago
Bounding nonsplitting enumeration degrees
We show that every nonzero Σ0 2 enumeration degree bounds a nonsplitting nonzero enumeration degree.
Thomas F. Kent, Andrea Sorbi
CC
2010
Springer
112views System Software» more  CC 2010»
13 years 5 months ago
Random Cnf's are Hard for the Polynomial Calculus
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...
Eli Ben-Sasson, Russell Impagliazzo
FOCS
2003
IEEE
14 years 4 months ago
Polynomial Degree vs. Quantum Query Complexity
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...
Andris Ambainis