-
1
-
-
0040517363
-
The rank of sparse random matrices over finite fields
-
J. Blömer, R. Karp, and E. Welzl The rank of sparse random matrices over finite fields Random Struct. Algorithms 10 1997 407 419
-
(1997)
Random Struct. Algorithms
, vol.10
, pp. 407-419
-
-
Blömer, J.1
Karp, R.2
Welzl, E.3
-
2
-
-
84968521645
-
Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm
-
D. Coppersmith Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm Math. Comp. 62 205 1994 333 350
-
(1994)
Math. Comp.
, vol.62
, Issue.205
, pp. 333-350
-
-
Coppersmith, D.1
-
3
-
-
0000006297
-
A probabilistic remark on algebraic program testing
-
R.A. DeMillo, and R.J. Lipton A probabilistic remark on algebraic program testing Inform. Process. Lett. 7 4 1978 193 195
-
(1978)
Inform. Process. Lett.
, vol.7
, Issue.4
, pp. 193-195
-
-
Demillo, R.A.1
Lipton, R.J.2
-
6
-
-
0030702656
-
On randomized Lanczos algorithms
-
W Küchline, ACM Press New York
-
W. Eberly, and E. Kaltofen On randomized Lanczos algorithms W Küchline, ISSAC 97 Proc. 1997, International Symposium on Symbolic and Algebraic Computation, New York 1997 ACM Press New York 176 183
-
(1997)
ISSAC 97 Proc. 1997, International Symposium on Symbolic and Algebraic Computation, New York
, pp. 176-183
-
-
Eberly, W.1
Kaltofen, E.2
-
9
-
-
0032514303
-
Certifying inconsistency of sparse linear systems
-
O. Gloor, ACM Press New York
-
M. Giesbrecht, A. Lobo, and B.D. Saunders Certifying inconsistency of sparse linear systems O. Gloor, ISSAC 98 Proc. 1998, International Symposium on Symbolic and Algebraic Computation, New York 1998 ACM Press New York 113 119
-
(1998)
ISSAC 98 Proc. 1998, International Symposium on Symbolic and Algebraic Computation, New York
, pp. 113-119
-
-
Giesbrecht, M.1
Lobo, A.2
Saunders, B.D.3
-
10
-
-
84968492714
-
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems
-
E. Kaltofen Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems Math. Comp. 64 210 1995 777 806
-
(1995)
Math. Comp.
, vol.64
, Issue.210
, pp. 777-806
-
-
Kaltofen, E.1
-
11
-
-
0003043247
-
Challenges of symbolic computation my favorite open problems
-
with an additional open problem by R.M. Corless and D.J. Jeffrey
-
E. Kaltofen Challenges of symbolic computation my favorite open problems J. Symbolic Comput. 29 6 2000 891 919 with an additional open problem by R.M. Corless and D.J. Jeffrey
-
(2000)
J. Symbolic Comput.
, vol.29
, Issue.6
, pp. 891-919
-
-
Kaltofen, E.1
-
12
-
-
0030395909
-
On rank properties of Toeplitz matrices over finite fields
-
Y.N. Lakshman, ACM Press New York
-
E. Kaltofen, and A. Lobo On rank properties of Toeplitz matrices over finite fields Y.N. Lakshman, ISSAC 96 Proc. 1996, International Symposium on Symbolic and Algebraic Computation, New York 1996 ACM Press New York 241 249
-
(1996)
ISSAC 96 Proc. 1996, International Symposium on Symbolic and Algebraic Computation, New York
, pp. 241-249
-
-
Kaltofen, E.1
Lobo, A.2
-
13
-
-
85027598825
-
Processor-efficient parallel solution of linear systems II: The positive characteristic and singular cases
-
IEEE Computer Society Press Silver Spring, MD
-
E. Kaltofen, and V. Pan Processor-efficient parallel solution of linear systems II: the positive characteristic and singular cases in: Proc. 33rd Annual Symposium on Foundations of Computer Science, Los Alamitos, CA 1992 IEEE Computer Society Press Silver Spring, MD 714 723
-
(1992)
Proc. 33rd Annual Symposium on Foundations of Computer Science, Los Alamitos, CA
, pp. 714-723
-
-
Kaltofen, E.1
Pan, V.2
-
14
-
-
84968495217
-
On Wiedemann's method of solving sparse linear systems
-
H.F. Mattson, T. Mora, T.R.N. Rao (Eds.) Springer, Berlin
-
E. Kaltofen, B.D. Saunders, On Wiedemann's method of solving sparse linear systems, in: H.F. Mattson, T. Mora, T.R.N. Rao (Eds.), Proc. AAECC-9, Heidelberg, Germany, 1991, Lecture Notes in Computer Science, vol. 539, Springer, Berlin, pp. 29-38
-
Proc. AAECC-9, Heidelberg, Germany, 1991, Lecture Notes in Computer Science
, vol.539
, pp. 29-38
-
-
Kaltofen, E.1
Saunders, B.D.2
-
15
-
-
84992074342
-
Computing with polynomials given by black boxes for their evaluations: Greatest common divisors factorization separation of numerators and denominators
-
E. Kaltofen, and B. Trager Computing with polynomials given by black boxes for their evaluations: greatest common divisors factorization separation of numerators and denominators J. Symbolic Comput. 9 3 1990 301 320
-
(1990)
J. Symbolic Comput.
, vol.9
, Issue.3
, pp. 301-320
-
-
Kaltofen, E.1
Trager, B.2
-
17
-
-
0009884710
-
-
PhD. Thesis, Rensselaer Polytechnic Institute, Troy, New York, December
-
A. Lobo, Matrix-free linear system solving and applications to symbolic computation, PhD. Thesis, Rensselaer Polytechnic Institute, Troy, New York, December, 1995
-
(1995)
Matrix-free Linear System Solving and Applications to Symbolic Computation
-
-
Lobo, A.1
-
18
-
-
85139975781
-
Diophantine linear system solving
-
T. Mulders, and A. Strorjohann Diophantine linear system solving in: International Symposium on Symbolic and Algebraic Computation, Vancover, BC, Candada July 1999 181 188
-
(1999)
International Symposium on Symbolic and Algebraic Computation, Vancover, BC, Candada
, pp. 181-188
-
-
Mulders, T.1
Strorjohann, A.2
-
19
-
-
84966229708
-
On computations with dense structured matrices
-
V. Pan On computations with dense structured matrices Math. Comp. 55 1990 179 190
-
(1990)
Math. Comp.
, vol.55
, pp. 179-190
-
-
Pan, V.1
-
22
-
-
84976779342
-
Fast probabilistic algorithms for verification of polynomical identities
-
J. Schwartz Fast probabilistic algorithms for verification of polynomical identities J. ACM 27 1980 701 717
-
(1980)
J. ACM
, vol.27
, pp. 701-717
-
-
Schwartz, J.1
-
24
-
-
84924373805
-
Block solution of sparse linear systems over GF(q): The singular case
-
G. Villard Block solution of sparse linear systems over GF(q): the singular case SIGSAM Bull. 32 4 1998 10 12
-
(1998)
SIGSAM Bull.
, vol.32
, Issue.4
, pp. 10-12
-
-
Villard, G.1
-
25
-
-
0022583143
-
Solving sparse linear equations over finite fields
-
D. Wiedemann Solving sparse linear equations over finite fields IEEE Trans. Inform. Theory IT-32 1986 54 62
-
(1986)
IEEE Trans. Inform. Theory
, vol.32 IT-
, pp. 54-62
-
-
Wiedemann, D.1
-
26
-
-
84925463455
-
Probabilistic algorithms for sparse polynomials
-
Springer Berlin
-
R. Zippel Probabilistic algorithms for sparse polynomials in: Proc. EUROSAM '79, Heidelberg, Germany, Lecture Notes in Computer Science, vol. 72 1979 Springer Berlin 216 226
-
(1979)
Proc. EUROSAM '79, Heidelberg, Germany, Lecture Notes in Computer Science, Vol. 72
, pp. 216-226
-
-
Zippel, R.1
|