AN EFFICIENT INCREMENTAL ALGORITHM FOR SOLVING SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS

被引：66

作者：

CONTEJEAN, E ^{[1
]}

DEVIE, H ^{[1
]}

机构：

[1] MAX PLANCK INST INFORMAT,W-6600 SAARBRUCKEN,GERMANY

来源：

INFORMATION AND COMPUTATION | 1994年 / 113卷 / 01期

关键词：

D O I：

10.1006/inco.1994.1067

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we describe an algorithm for solving systems of linear Diophantine equations based on a generalization of an algorithm for solving one equation due to Fortenbacher. It can solve a system as a whole, or be used incrementally when the system is a sequential accumulation of several subsystems. The proof of termination of the algorithm is difficult, whereas the proofs of completeness and correctness are straightforward generalizations of Fortenbacher's proof. (C) 1994 Academic Press, Inc.

引用

页码：143 / 172

页数：30

共 13 条

[1]

BOUDET A, 1990, 5TH P IEEE S LOG COM

[2]

BUCHBERGER B, 1983, LECT NOTES COMPUT SC

[3] EFFICIENT SOLUTION OF LINEAR DIOPHANTINE EQUATIONS [J].

CLAUSEN, M ;

FORTENBACHER, A .

JOURNAL OF SYMBOLIC COMPUTATION, 1989, 8 (1-2) :201-216

[4]

CONTEJEAN E, 1991, CR ACAD SCI I-MATH, V313, P115

[5]

CONTEJEAN E, 1989, 3RD P WORKSH UN LAMB

[6]

DINCBAS M, 1988, 5TH P INT C GEN COMP, P693

[7]

DOMENJOUD E, 1991, THESIS U NANCY I

[8]

Farkas J, 1902, J REINE ANGEW MATH, V124, P1

[9]

GARDNER M, 1983, SCI AM, V24, P12

[10]

HUET G, 1978, INFORM PROCESS LETT, V7

← 1 2 →