Using the Blankinship algorithm to find the general solution of a linear diophantine equation

DOI10.1007/BF00288771zbMath0411.10005MaRDI QIDQ1259617

Harvey M. Salkin, Morito, Susumu

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

Blankinship algorithmsolution of linear diophantine equation

Mathematics Subject Classification ID

Integer programming (90C10) Linear Diophantine equations (11D04)

Related Items (5)

Generic shape of multichromatic resonance peaks ⋮ Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review ⋮ Solving rank one perturbed linear Diophantine systems by the ABS method ⋮ Complexity questions in number theory ⋮ Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases

Cites Work

• Unnamed Item
• Unnamed Item
• Greatest Common Divisor of Several Integers and an Associated Linear Diophantine Equation
• Calculating the General Solution of a Linear Diophantine Equation
• Algorithm and bound for the greatest common divisor of n integers
• A New Version of the Euclidean Algorith

This page was built for publication: Using the Blankinship algorithm to find the general solution of a linear diophantine equation