1450 search results - page 83 / 290 » On the Complexity of Hardness Amplification |
JUCS
2006
13 years 9 months ago
2006
: The size and complexity of software systems are continuously increasing, which makes them difficult and labor-intensive to develop, test and evolve. Since concurrent systems are ...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— Many robotic control tasks involve complex dynamics that are hard to model. Hand-specifying trajectories that satisfy a system’s dynamics can be very time-consuming a...
SWAT
2010
Springer
13 years 7 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
ICASSP
2011
IEEE
13 years 24 days ago
2011
IEEE
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...