Download:
|
by Jean-guillaume. Dumas, B. D. Saunders, G. Villard
http://www-id.imag.fr/~jgdumas/Publications/valence.ps.gz
Add To MetaCart
Abstract:
Information Sciences,
Citations
|
271
|
The Theory of Matrices
– Gantmacher
- 1960
|
|
46
|
Sylvester’s Identity and Multistep IntegerPreserving Gaussian Elimination
– Bareiss
- 1968
|
|
45
|
Exact solution of linear equations using p-adic expansions
– Dixon
- 1982
|
|
28
|
On randomized Lanczos algorithms
– Eberly, Kaltofen
- 1997
|
|
27
|
Complexes of not i-connected graphs, Topology 38
– Babson, Björner, et al.
- 1999
|
|
21
|
Zivaljević: Chessboard complexes and matching complexes
– Björner, Lovász, et al.
- 1994
|
|
14
|
Complexes of not i-connected graphs
– Babson, Bjorner, et al.
- 1999
|
|
13
|
Probabilistic computation of the Smith Normal Form of a sparse integer matrix
– Giesbrecht
- 1996
|
|
12
|
Complexes of directed graphs
– Björner, Welker
- 1999
|
|
6
|
Limits for the characteristic roots of a matrix
– Brauer
- 1947
|
|
5
|
Regions in the complex plane containing the eigenvalues of a matrix
– Brualdi, Mellendorf
- 1994
|
|
2
|
Simplicial Homology, a share package for
– Dumas, Heckenbach, et al.
- 2000
|
|
1
|
and Goliath : computing the rank of sparse matrices
– David
- 1999
|
|
1
|
Calcul du polyn^ome minimal entier en athapascan-1 et linbox
– Dumas
- 2000
|
|
1
|
Chessboard complexes and matching complexes
– oerner, A, et al.
- 1994
|
|
1
|
Complexes of directed graphs
– orner, A, et al.
- 1999
|
|
1
|
and Goliath : computing the rank of sparse matrices
– Dumas
- 1999
|
