2957 search results - page 82 / 592 » The Complexity of Polynomial-Time Approximation |
CORR
2008
Springer
13 years 6 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...
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
ISSAC
1997
Springer
13 years 12 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
COMAD
2009
13 years 8 months ago
2009
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
ALGORITHMICA
2007
13 years 7 months ago
2007
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...