1331 search results - page 7 / 267 » Complexity bounds for zero-test algorithms |
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...
IANDC
2010
14 years 8 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
116
click to vote
STOC
2012
ACM
13 years 7 hour ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
TIT
1998
14 years 9 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
ISAAC
2003
Springer
15 years 2 months ago
2003
Springer