3946 search results - page 351 / 790 » The computational complexity of choice sets |
179
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
188
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we introduce a novel Markov Chain (MC) representation aided Minimum Bit Error Rate (MBER) detection method that is applicable to an M-QAM modulated SDM/SDMA upli...
199
click to vote
SAINT
2007
IEEE
16 years 1 months ago
2007
IEEE
While by now feasible solutions to protect privacy for complex ubiquitous applications are available, very small devices, called context transponders (CTP) still lack resources to...
133
Voted
VTC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Three new adaptive equalization algorithms for wireless systems operating over frequency selective MIMO channels are proposed. The problem of the MIMO DFE design is formulated ...
153
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...