An efficient incremental algorithm for solving systems of linear diophantine equations (Q1333281): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q593501 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Joachim Piehler / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011618311 / rank | |||
Normal rank | |||
Latest revision as of 21:13, 19 March 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
