GREATEST COMMON DIVISOR MATRICES

被引:63
|
作者
BESLIN, S
LIGH, S
机构
关键词
D O I
10.1016/0024-3795(89)90572-7
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:69 / 76
页数:8
相关论文
共 50 条
  • [31] On the Greatest Common Divisor of the Value of Two Polynomials
    Frenkel, Peter E.
    Pelikan, Jozsef
    AMERICAN MATHEMATICAL MONTHLY, 2017, 124 (05): : 446 - 450
  • [32] On the greatest common divisor of two cullen numbers
    Luca, F
    ABHANDLUNGEN AUS DEM MATHEMATISCHEN SEMINAR DER UNIVERSITAT HAMBURG, 2003, 73 (1): : 253 - 270
  • [33] CALCULATION OF THE GREATEST COMMON DIVISOR OF PERTURBED POLYNOMIALS
    Zitko, Jan
    Elias, Jan
    PROGRAMS AND ALGORITHMS OF NUMERICAL MATHEMATICS 16, 2013, : 215 - 222
  • [34] GREATEST COMMON DIVISOR OF N INTEGERS AND MULTIPLIERS
    BRADLEY, GH
    COMMUNICATIONS OF THE ACM, 1970, 13 (07) : 447 - &
  • [35] THE SOLUTION OF GRAHAM GREATEST COMMON DIVISOR PROBLEM
    SZEGEDY, M
    COMBINATORICA, 1986, 6 (01) : 67 - 71
  • [36] Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
    Winkler, Joab R.
    Yang, Ning
    COMPUTER AIDED GEOMETRIC DESIGN, 2013, 30 (04) : 410 - 429
  • [37] Implementing Attacks on the Approximate Greatest Common Divisor Problem
    Wang, Leizhang
    Qu, Quanbo
    Li, Tuoyan
    Chen, Yange
    FRONTIERS IN CYBER SECURITY, FCS 2019, 2019, 1105 : 209 - 227
  • [38] ON THE GREATEST COMMON DIVISOR OF n AND THE nTH FIBONACCI NUMBER
    Leonetti, Paolo
    Sanna, Carlo
    ROCKY MOUNTAIN JOURNAL OF MATHEMATICS, 2018, 48 (04) : 1191 - 1199
  • [39] ALGORITHM AND BOUND FOR GREATEST COMMON DIVISOR OF N INTEGERS
    BRADLEY, GH
    COMMUNICATIONS OF THE ACM, 1970, 13 (07) : 433 - &
  • [40] On the greatest common divisor of two univariate polynomials, II
    Schinzel, A
    ACTA ARITHMETICA, 2001, 98 (01) : 95 - 106