1450 search results - page 71 / 290 » On the Complexity of Hardness Amplification |
SWAT
1994
Springer
14 years 1 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
DICTA
2003
13 years 10 months ago
2003
Abstract. Unit quaternion is an ideal parameterization for joint rotations. However, due to the complexity of the geometry of S3 group, it’s hard to specify meaningful joint cons...
IPL
2008
13 years 9 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
IJHPCA
2006
13 years 9 months ago
2006
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
ECCC
2007
13 years 9 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...