Sciweavers

13621 search results - page 39 / 2725
» Computability and Complexity in Self-assembly
Sort
View
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
13 years 4 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
CIE
2008
Springer
13 years 12 months ago
Computability and Complexity in Self-assembly
James I. Lathrop, Jack H. Lutz, Matthew J. Patitz,...
IJAC
2002
128views more  IJAC 2002»
13 years 9 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki