1941 search results - page 36 / 389 » On the Hardness of Approximate Reasoning |
ICC
2009
IEEE
2009
IEEE
Iterative Detection and Decoding for Hard-Decision Forwarding Aided Cooperative Spatial Multiplexing
15 years 6 months ago
— In this paper, 1 the optimal decoding strategy for cooperative spatial multiplexing (CSM) aided systems is derived. In CSM systems, the multiple relay stations (RSs), which com...
109
click to vote
TAMC
2010
Springer
14 years 10 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
COCO
2006
Springer
15 years 3 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
ECSQARU
2009
Springer
15 years 6 months ago
2009
Springer
ICLP
2007
Springer
15 years 6 months ago
2007
Springer
