An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers-Reference-Cited by-同舟云学术

An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers

Published:2009-11 Issue:6 Volume:45 Page:875-880
ISSN:1060-0396
Container-title:Cybernetics and Systems Analysis
language:en
Short-container-title:Cybern Syst Anal

Author:

Kryvyi S. L.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s10559-009-9160-y.pdf

Reference12 articles.

1. S. L. Kryvyi, “Algorithms for solving systems of linear Diophantine equations in integer domains,” Cybernetics and Systems Analysis, No. 2, 3–17 (2006).

2. G. A. Donets, “Solution of the safe problem on (0,1)-matrices,” Cybernetics and Systems Analysis, No. 1, 98–105 (2002).

3. A. V. Cheremushkin, Lectures on Arithmetic Algorithms in Cryptography [in Russian], MTsNMO, Moscow (2002).

4. F. Baader and J. Ziekmann, “Unification Theory,” in: Handbook of Logic in Artificial Intelligence and Logic Programming, University Press, Oxford (1994), pp. 1–85.

5. R. Allen and K. Kennedy, “Automatic translation of FORTRAN programs to vector form,” ACM Transactions on Programming Languages and Systems, 9, No. 4, 491–542 (1987).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithms for Solving Linear Equations over Associative Rings with Unit Element;Cybernetics and Systems Analysis;2021-11

2. Solving Linear Diophantine Systems on Parallel Architectures;IEEE Transactions on Parallel and Distributed Systems;2019-05-01

3. Combinatorial Method for Solving Systems of Linear Constraints;Cybernetics and Systems Analysis;2014-07