3208 search results - page 287 / 642 » A Lower Bound for Primality |
181
click to vote
TIT
2008
15 years 6 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
146
click to vote
TIT
1998
15 years 6 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
203
click to vote
ECCC
2011
15 years 1 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
294
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
In this work we show how to use efficient online trading algorithms to price the current value of financial instruments, such as an option. We derive both upper and lower bounds f...
162
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...