13603 search results - page 143 / 2721 » On the Complexity of Computing Treelength |
150
click to vote
SIAMMAX
2011
14 years 11 months ago
2011
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
104
click to vote
MOC
1998
15 years 3 months ago
1998
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
182
click to vote
FPL
2010
Springer
15 years 2 months ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
168
click to vote
SIGECOM
2011
ACM
14 years 7 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
