AN EFFICIENT INCREMENTAL ALGORITHM FOR SOLVING SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS

被引：65
|
作者：
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
相关论文
共 50 条
12345