630 search results - page 74 / 126 » Hardness results for approximating the bandwidth |
157
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
172
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
186
click to vote
CIE
2007
Springer
16 years 11 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
173
click to vote
ICASSP
2008
IEEE
16 years 19 days ago
2008
IEEE
Consider a scenario where a distributed signal is sparse and is acquired by various sensors that see different versions. Thus, we have a set of sparse signals with both some commo...
152
click to vote
WIMOB
2008
IEEE
16 years 17 days ago
2008
IEEE
—Wireless networking is currently dominated by radio frequency (RF) techniques. However, the soon-to-be ubiquity of LED-based lighting motivated by significant energy savings pro...