Algorithms for solving linear constraints over the ring of integers

DOI10.1007/S10559-024-00706-2MaRDI QIDQ6638456zbMATH OpenFDO

Authors S. L. Kryvyi

Publication date 14 November 2024

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

Full work available at URL https://doi.org/10.1007/S10559-024-00706-2

zbMATH Keywords

algorithmsring of integerssystems of linear constraints

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Computational number theory (11Yxx) Diophantine equations (11Dxx)

Recommendations

• An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers
• Solution algorithms for systems of linear equations over residue rings
• Mathematical Foundations of Computer Science 2005
• Algorithms for solving systems of linear Diophantine equations in residue rings
• Algorithms for solving systems of linear Diophantine equations in integer domains

Cites work

• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• Algorithms for solving linear equations over associative rings with unit element
• An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers
• Efficient solution of linear diophantine equations
• Handbook of automated reasoning. In 2 vols

This page was built for publication: Algorithms for solving linear constraints over the ring of integers

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