Algorithms for solution of systems of linear Diophantine equations in residue fields

DOI10.1007/s10559-007-0036-8zbMath1228.11182OpenAlexW2028336034MaRDI QIDQ2458039

S. L. Kryvyi

Publication date: 31 October 2007

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-007-0036-8

zbMATH Keywords

solution setlinear Diophantine equationresidue fieldbasis of

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Linear Diophantine equations (11D04)

Related Items (6)

Solution algorithms for systems of linear equations over residue rings ⋮ Algorithms for solving systems of linear Diophantine equations in residue rings ⋮ Combinatorial method for solving systems of linear constraints ⋮ Numerical methods to solve problems on a mathematical safe ⋮ Partitioning a set of vectors with integer coordinates by means of logical hardware ⋮ Symmetric information exchange system based on ring isomorphism

Cites Work

• A polynomial algorithm for solving systems of two linear diophantine equations
• Efficient solution of linear diophantine equations
• Avoiding slack variables in the solving of linear diophantine equations and inequations
• Solution of the safe problem on (0,1)-matrices
• A fast method for finding the basis of non-negative solutions to a linear diophantine equation
• Algorithms for solving systems of linear Diophantine equations in integer domains
• Automatic translation of FORTRAN programs to vector form

This page was built for publication: Algorithms for solution of systems of linear Diophantine equations in residue fields