Sciweavers

537 search results - page 12 / 108
» A new upper bound for 3-SAT
Sort
View
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 8 months ago
New degree bounds for polynomial threshold functions
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
Ryan O'Donnell, Rocco A. Servedio
EUROCRYPT
2003
Springer
14 years 1 months ago
New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
Renato Renner, Stefan Wolf
WIOPT
2010
IEEE
13 years 6 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
WCNC
2010
IEEE
14 years 9 days ago
Performance Bounds for AF Multi-Hop Relaying over Nakagami Fading
Abstract—This paper presents a new upper bound on the endto-end signal-to-noise ratio (SNR) of channel-assisted amplifyand-forward (AF) multi-hop relay networks. The harmonic mea...
Gayan Amarasuriya, Chintha Tellambura, Masoud Arda...
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 8 months ago
New bounds on classical and quantum one-way communication complexity
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
Rahul Jain, Shengyu Zhang