1450 search results - page 7 / 290 » On the Complexity of Hardness Amplification |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...
ITA
2000
13 years 7 months ago
2000
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
SIGAL
1990
13 years 11 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
RAS
2008
13 years 7 months ago
2008
A still growing number of software concepts and framworks have been proposed to meet the challenges in the development of more and more complex robotic systems, like humanoids or n...