Solution algorithms for systems of linear equations over residue rings

DOI10.1007/s10559-016-9880-8zbMath1355.65059OpenAlexW2521621838MaRDI QIDQ341378

S. L. Kryvyi

Publication date: 16 November 2016

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

Full work available at URL: https://doi.org/10.1007/s10559-016-9880-8

zbMATH Keywords

algorithmpolynomial complexityfactorization of the modulus into prime numbersresidue ringsystem of linear Diophantine equationstruncated solution set method

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Complexity and performance of numerical algorithms (65Y20) Linear Diophantine equations (11D04)

Cites Work

• Algorithms for solving systems of linear Diophantine equations in residue rings
• Solution of the safe problem on (0,1)-matrices
• Algorithms for solving systems of linear Diophantine equations in integer domains
• Algorithms for solution of systems of linear Diophantine equations in residue fields

This page was built for publication: Solution algorithms for systems of linear equations over residue rings