ALGORITHMS FOR SOLVING SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS IN RESIDUE RINGS

被引：7

作者：

Kryvyi, S. L. ^{[1
]}

机构：

[1] Natl Acad Sci Ukraine, Inst Cybernet, Kiev, Ukraine

来源：

CYBERNETICS AND SYSTEMS ANALYSIS | 2007年 / 43卷 / 06期

关键词：

residue ring; linear Diophantine equation; basis of a solution set;

D O I：

10.1007/s10559-007-0103-1

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Algorithms are proposed that construct the basis of the set of solutions to a system of homogeneous or inhomogeneous linear Diophantine equations in a residue ring modulo n when the prime factors of n are known.

引用

页码：787 / 798

页数：12

共 8 条

[1] AUTOMATIC TRANSLATION OF FORTRAN PROGRAMS TO VECTOR FORM
ALLEN, R
KENNEDY, K
[J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1987, 9 (04): : 491 - 542
[2] Cheremushkin A. V., 2002, LECT ARITHMETIC ALGO
[3] AN EFFICIENT INCREMENTAL ALGORITHM FOR SOLVING SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS
CONTEJEAN, E
DEVIE, H
[J]. INFORMATION AND COMPUTATION, 1994, 113 (01) : 143 - 172
[4] Donets G. A., 2002, KIBERN SIST ANAL, P98
[5] Donets G. A., 2005, THEORY OPTIMAL SOLUT, P15
[6] Kryviy S. L., 1999, KIBERN SIST ANAL, P12
[7] Kryvyi S. L., 2007, CYBERNET SYST, P15
[8] Kryvyi S. L., 2006, CYBERNET SYST, V2, P3

← 1 →