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

Authors:
S. L. Kryvyi
Affiliations:
Taras Shevchenko National University, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2009

Citing 9
Cited 0

Automatic translation of FORTRAN programs to vector form

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient solution of linear diophantine equations

Journal of Symbolic Computation
A polynomial algorithm for solving systems of two linear diophantine equations

Theoretical Computer Science
Minimal solutions of linear diophantine systems: bounds and algorithms

RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Unification theory

Handbook of logic in artificial intelligence and logic programming
A fast method for finding the basis of nonnegative solutions to a linear Diophantine equation

Journal of Symbolic Computation
Avoiding slack variables in the solving of linear diophantine equations and inequations

Theoretical Computer Science - Special issue: principles and practice of constraint programming
Solution of the Safe Problem on (0,1)-Matrices

Cybernetics and Systems Analysis
Algorithms for solving systems of linear diophantine equations in integer domains

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A polynomial algorithm is proposed to construct the minimal generating set of solutions and the basis of the solution set for systems of linear Diophantine equations over the ring of integer. The algorithm is based on a modified TSS method.