Sciweavers

106 search results - page 1 / 22
» A Linear Space Algorithm for Computing the Hermite Normal Fo...
Sort
View
ECCC
2000
81views more  ECCC 2000»
13 years 4 months ago
A Linear Space Algorithm for Computing the Hermite Normal Form
Computing the Hermite Normal Form of an n
Daniele Micciancio, Bogdan Warinschi
WAN
1998
Springer
13 years 9 months ago
Some Performance Studies in Exact Linear Algebra
We consider parallel algorithms for computing the Hermite normal form of matrices over Euclidean rings. We use standard types of reduction methods which are the basis of many algor...
George Havas, Clemens Wagner 0002
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 4 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
13 years 9 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
13 years 9 months ago
Algorithms for Large Integer Matrix Problems
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...