USING THE BLANKINSHIP ALGORITHM TO FIND THE GENERAL-SOLUTION OF A LINEAR DIOPHANTINE EQUATION

被引：9

作者：

MORITO, S

SALKIN, HM

机构：

来源：

关键词：

D O I：

10.1007/BF00288771

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：379 / 382

页数：4

共 7 条

[1] A NEW VERSION OF EUCLIDEAN ALGORITHM [J].

BLANKINSHIP, WA .

[2] CALCULATING GENERAL SOLUTION OF A LINEAR DIOPHANTINE EQUATION [J].

BOND, J .

[3] ALGORITHM AND BOUND FOR GREATEST COMMON DIVISOR OF N INTEGERS [J].

BRADLEY, GH .

[4]

CHASE WM, 1975, INDIRECT THREAT ALGO

[5]

MORITO S, 1977, 429 CAS WEST RES U D

[6]

SALKIN HM, 1975, INTEGER PROGRAMMING, P314

[7]

Weinstock R., 1960, AM MATH MON, V67, P664