SCOPUS 정보 검색 플랫폼

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2002, Pages 138-144

An output-sensitive variant of the baby steps/giant steps determinant algorithm

(1) Kaltofen, Erich a

a NORTH CAROLINA STATE UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; FAST FOURIER TRANSFORMS; MATRIX ALGEBRA; MONTE CARLO METHODS; POLYNOMIALS; PROBLEM SOLVING;

BIT COMPLEXITY; CHINESE REMAINDERING; GAUSSIAN ELIMINATION; INTEGERS; MATRIX MULTIPLICATION; OUTPUT-SENSITIVE VARIANT; POLYLOGARITHMIC FACTORS; RANDOMIZATION;

ALGORITHMS;

EID: 0036052732 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: 10.1145/780506.780524 Document Type: Conference Paper

Times cited : (13)

References (31)

1
- 0005390864
- Fast deterministic computation of determinants of dense matrices
- S. Dooley, Ed., ACM Press
- ISSAC 99 Proc. 1999 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 1999) , pp. 181-188
- Abbott, J.¹ Bronstein, M.² Mulders, T.³

2
- 0003415652
- Addison and Wesley, Reading, MA
- (1974) The Design and Analysis of Algorithms
- Aho, A.¹ Hopcroft, J.² Ullman, J.³

3
- 84983014125
- Fast solution of Toeplitz systems of equations and computation of Padé approximants
- (1980) J. Algorithms , vol.1 , pp. 259-295
- Brent, R.P.¹ Gustavson, F.G.² Yun, D.Y.Y.³

4
- 0000977233
- Sign determination in residue number systems
- Special issue on real numbers and computers
- (1999) Theoretical Comput. Sci. , vol.210 , Issue.1 , pp. 173-197
- Brönnimann, H.¹ Emiris, I.² Pan, V.³ Pion, S.⁴

5
- 31244437321
- Efficient matrix preconditioners for black box linear algebra
- Special issue on Structured and Infinite Systems of Linear Equations, edited by P. Dewilde, V. Olshevsky and A. H. Sayed
- (2002) Linear Algebra and Applications , vol.343-344 , pp. 119-146
- Chen, L.¹ Eberly, W.² Kaltofen, E.³ Saunders, B.D.⁴ Turner, W.J.⁵ Villard, G.⁶

6
- 84968521645
- Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm
- (1994) Math. Comput. , vol.62 , Issue.205 , pp. 333-350
- Coppersmith, D.¹

7
- 0031097276
- Rectangular matrix multiplication revisited
- (1997) J. Complexity , vol.13 , pp. 42-49
- Coppersmith, D.¹

8
- 85023205150
- Matrix multiplication via arithmetic progressions
- Special issue on complexity theory
- (1990) J. Symbolic Comput. , vol.9 , Issue.3 , pp. 251-280
- Coppersmith, D.¹ Winograd, S.²

9
- 0005478990
- Fast matrix algebra on apple G4
- Mar.
- (2000)
- Crandall, R.¹ Klivington, J.²

10
- 0034511243
- On computing the determinant and Smith form of an integer matrix
- IEEE Computer Society Press
- Proc. 41st Annual Symp. Foundations of Comp. Sci. (Los Alamitos, California, 2000)
- Eberly, W.¹ Giesbrecht, M.² Villard, G.³

11
- 0032396697
- A complete implementation for computing general dimensional convex hulls
- (1998) Int. J. Comput. Geom. Appl. , vol.8 , Issue.2 , pp. 223-254
- Emiris, I.Z.¹

12
- 0024082468
- DAGWOOD: A system for manipulating polynomials given by straight-line programs
- (1988) ACM Trans. Math. Software , vol.14 , Issue.3 , pp. 218-240
- Freeman, T.S.¹ Imirzian, G.² Kaltofen, E.³ Yagati, L.⁴

13
- 0015204286
- On decreasing the computing time for modular arithmetic
- (1971) Conference Record, IEEE 12th Annual Symp. on Switching and Automata Theory , pp. 126-128
- Heindel, L.E.¹ Horowitz, E.²

14
- 0030673980
- Fast rectangular matrix multiplications and improving parallel matrix computations
- M. Hitz and E. Kaltofen, Eds., ACM Press
- Proc. Second Internat. Symp. Parallel Symbolic Comput. PASCO '97 (New York, N. Y., 1997) , pp. 11-23
- Huang, X.¹ Pan, V.²

15
- 49249136112
- On computing determinants of matrices without divisions
- P. S. Wang, Ed., ACM Press
- Proc. 1992 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'92) (New York, N. Y., 1992) , pp. 342-349
- Kaltofen, E.¹

16
- 84968492714
- Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems
- (1995) Math. Comput. , vol.64 , Issue.210 , pp. 777-806
- Kaltofen, E.¹

17
- 0033657471
- Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
- C. Traverso, Ed., ACM Press
- Proc. 2000 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'00) (New York, N. Y., 2000) , pp. 192-201
- Kaltofen, E.¹ Lee, W.-S.² Lobo, A.A.³

18
- 85058940739
- Processor efficient parallel solution of linear systems over an abstract field
- ACM Press
- Proc. SPAA '91 3rd Ann. ACM Symp. Parallel Algor. Architecture (New York, N.Y., 1991) , pp. 180-191
- Kaltofen, E.¹ Pan, V.²

19
- 84992074342
- Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators
- (1990) J. Symbolic Comput. , vol.9 , Issue.3 , pp. 301-320
- Kaltofen, E.¹ Trager, B.²

20
- 0002671829
- On the complexity of computing determinants
- K. Shirayanagi and K. Yokoyama, Eds., vol. 9 of Lecture Notes Series on Computing, World Scientific; Invited contribution; extended abstract
- Proc. Fifth Asian Symposium on Computer Mathematics (ASCM 2001) (Singapore, 2001) , pp. 13-27
- Kaltofen, E.¹ Villard, G.²

21
- 0002642990
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey
- Submitted to the special issue on Congrès International Algèbre Linéaire et Arithmétique: Calcul Numérique, Symbolique et Parallèle, held in Rabat, Morocco, May 2001
- (2002) J. Computational Applied Math. , pp. 17
- Kaltofen, E.¹ Villard, G.²

22
- 0003687656
- Early termination strategies in sparse interpolation algorithms
- PhD thesis, North Carolina State Univ., Raleigh, North Carolina, Dec.
- (2001) , pp. 107
- Lee, W.-S.¹

23
- 0015772422
- Fast computation of GCDs
- (1973) Proc. 5th ACM Symp. Theory Comp. , pp. 142-151
- Moenck, R.T.¹

24
- 0002534227
- On the number of nonscalar multiplications necessary to evaluate polynomials
- (1973) SIAM J. Comp. , vol.2 , pp. 60-66
- Paterson, M.S.¹ Stockmeyer, L.J.²

25
- 84972540003
- Approximate formulas of some functions of prime numbers
- (1962) Illinois J. Math. , vol.6 , pp. 64-94
- Rosser, J.B.¹ Schoenfeld, L.²

26
- 0005390670
- Higher-order lifting
- These proceedings
- Proc. 2002 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'02)
- Storjohann, A.¹

27
- 0034782094
- Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
- B. Mourrain, Ed., ACM Press
- ISSAC 2001 Proc. 2001 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2001) , pp. 323-331
- Thomé, E.¹

28
- 0005390867
- A note on determinantal divisors and matrix preconditioners
- Paper to be submitted, Oct.
- (2001)
- Turner, W.J.¹

29
- 0030658654
- Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems
- W. Küchlin, Ed., ACM Press
- ISSAC 97 Proc. 1997 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 1997) , pp. 32-39
- Villard, G.¹

30
- 0003942673
- A study of Coppersmith's block Wiedemann algorithm using matrix polynomials
- Rapport de Recherche 975 IM, Institut d'Informatique et de Mathématiques Appliquées de Grenoble; Apr.
- (1997)
- Villard, G.¹

31
- 0022583143
- Solving sparse linear equations over finite fields
- (1986) IEEE Trans. Inf. Theory , vol.IT-32 , pp. 54-62
- Wiedemann, D.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.