42230 search results - page 90 / 8446 » Algorithms and Complexity Results for |
CORR
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
ISSAC
1997
Springer
15 years 2 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
AAAI
2006
14 years 11 months ago
2006
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
JSAC
2008
14 years 9 months ago
2008
Abstract--Optimal tone allocation in downlink OFDMA networks is a non-convex NP-hard problem that requires extensive feedback for channel information. In this paper, two constantco...