1089 search results - page 65 / 218 » Bounds on generalized Frobenius numbers |
MP
2006
13 years 7 months ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
JCT
2010
13 years 6 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set uppe...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We consider a multiple access channel (MAC) with channel state information (CSI) non-causally known at some encoders. For simplicity of exposition, we focus on a two-encoder model...