A POLYNOMIAL ALGORITHM FOR SOLVING SYSTEMS OF 2 LINEAR DIOPHANTINE EQUATIONS

被引:7
|
作者
ROMEUF, JF
机构
[1] Laboratoire d'Informatique de Rouen, Université de Rouen, Faculté des Sciences, 76134 Mont-Saint-Aignan Cedex, Place Émile Blondel
关键词
Mathematical Techniques - Algebra;
D O I
10.1016/0304-3975(90)90082-S
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present an algorithm which computes a minimal length solution of a system of two linear diophantine equations with a complexity O(kl2), where k is the number of variables, and l the max of the absolute values of the coefficients of the system. We also introduce a new efficient algorithm which computes a rational expression of all the solutions of such a system, and we give an upper bound in length of the terms of this expression. © 1990.
引用
收藏
页码:329 / 340
页数:12
相关论文
共 50 条