메뉴 건너뛰기




Volumn , Issue , 2003, Pages 255-257

A Note on the Hermite Basis Computation of Large Integer Matrices

Author keywords

Hermite Normal Form; Index Calculus

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; SET THEORY;

EID: 1542318400     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/860854.860905     Document Type: Conference Paper
Times cited : (4)

References (8)
  • 1
    • 85023205150 scopus 로고
    • Matrix multiplication via arithmetic progressions
    • D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Comput, 9(3):251-280, 1990.
    • (1990) J. Symbolic Comput , vol.9 , Issue.3 , pp. 251-280
    • Coppersmith, D.1    Winograd, S.2
  • 2
    • 0001380055 scopus 로고
    • Exact solution of linear equations using p-adic expansions
    • J. D. Dixon. Exact solution of linear equations using p-adic expansions. Numer. Math., 40(1):137-141, 1982.
    • (1982) Numer. Math. , vol.40 , Issue.1 , pp. 137-141
    • Dixon, J.D.1
  • 3
    • 84974687856 scopus 로고    scopus 로고
    • Algorithms for large integer matrix problems
    • Applied algebra, algebraic algorithms and error-correcting codes (Melbourne). Springer, Berlin
    • M. Giesbrecht, M. Jacobson. Jr., and A. Storjohann. Algorithms for large integer matrix problems. In Applied algebra, algebraic algorithms and error-correcting codes (Melbourne, 2001), volume 2227 of Lecture Notes in Comput. Sci., pages 297-307. Springer, Berlin, 2001.
    • (2001) Lecture Notes in Comput. Sci. , vol.2227 , pp. 297-307
    • Giesbrecht, M.1    Jacobson Jr., M.2    Storjohann, A.3
  • 4
    • 0026403469 scopus 로고
    • Asymptotically fast triangularization of matrices over rings
    • J. Hafner and K. McCurley. Asymptotically fast triangularization of matrices over rings. SIAM J. Comput., 20:1068-1083, 1991.
    • (1991) SIAM J. Comput. , vol.20 , pp. 1068-1083
    • Hafner, J.1    McCurley, K.2
  • 8
    • 84958554059 scopus 로고    scopus 로고
    • An accelerated Buchmann algorithm for regulator computation in real quadratic fields
    • Algorithmic Number Theory, ANTS-V. Springer-Verlag
    • U. Vollmer. An accelerated Buchmann algorithm for regulator computation in real quadratic fields. In Algorithmic Number Theory, ANTS-V, volume 2369 of Lecture Notes in Computer Science, pages 148-162. Springer-Verlag, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2369 , pp. 148-162
    • Vollmer, U.1


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