Sciweavers

19320 search results - page 118 / 3864
» On the complexity of computing determinants
Sort
View
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
14 years 11 months ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock
79
Voted
CIE
2008
Springer
15 years 6 months ago
Computability and Complexity in Self-assembly
James I. Lathrop, Jack H. Lutz, Matthew J. Patitz,...
BMCBI
2007
109views more  BMCBI 2007»
15 years 4 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....