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

DOI10.1007/BF00288771MaRDI QIDQ1259617zbMATHFDO

Authors Harvey M. Salkin, Susumu Morito

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)

Cites work

• scientific article; zbMATH DE number 3650641 (Why is no real title available?)
• scientific article; zbMATH DE number 3501240 (Why is no real title available?)
• A New Version of the Euclidean Algorith
• Algorithm and bound for the greatest common divisor of n integers
• Calculating the General Solution of a Linear Diophantine Equation
• Greatest Common Divisor of Several Integers and an Associated Linear Diophantine Equation

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1259617)