Algorithms for solving systems of linear diophantine equations in integer domainsReport as inadecuate




Algorithms for solving systems of linear diophantine equations in integer domains - Download this document for free, or read online. Document in PDF available to download.

Cybernetics and Systems Analysis

, Volume 42, Issue 2, pp 163–175

Received: 27 January 2005

Abstract

Algorithms are described that solve homogeneous systems of linear Diophantine equations over natural numbers and over the set {0, 1}. Properties of the algorithms and their time estimates are given.

Keywordslinear Diophantine equation basis of a solution set minimal supported set of solutions 

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 3–17, March–April 2006.

Download to read the full article text



Author: S. L. Kryvyi

Source: https://link.springer.com/







Related documents