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

DOI10.1007/BF00288771zbMATH Open0411.10005MaRDI QIDQ1259617FDOQ1259617

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

• Algorithm and bound for the greatest common divisor of n integers
• A New Version of the Euclidean Algorith
• Title not available (Why is that?)
• Calculating the General Solution of a Linear Diophantine Equation
• Title not available (Why is that?)
• Greatest Common Divisor of Several Integers and an Associated Linear Diophantine Equation

Cited In (5)

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

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)