An efficient incremental algorithm for solving systems of linear diophantine equations (Q1333281): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:55, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient incremental algorithm for solving systems of linear diophantine equations |
scientific article |
Statements
An efficient incremental algorithm for solving systems of linear diophantine equations (English)
0 references
2 April 1995
0 references
By generalization of an algorithm by Fortenbacher [\textit{M. Clausen} and \textit{A. Fortenbacher}, J. Symb. Comput. 8, 201-216 (1989; Zbl 0674.10011)] for solving one linear equation an efficient method for solving a system of linear diophantine equations is given. The paper contains proofs of termination, completeness, and correctness; it contains also comparisons with other algorithms.
0 references
systems of linear diophantine equations
0 references
algorithm
0 references
