Algorithms for solution of systems of linear Diophantine equations in residue fields
From MaRDI portal
Publication:2458039
DOI10.1007/S10559-007-0036-8zbMATH Open1228.11182OpenAlexW2028336034MaRDI QIDQ2458039FDOQ2458039
Authors: 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
Cites Work
- Algorithms for solving systems of linear Diophantine equations in integer domains
- Solution of the safe problem on (0,1)-matrices
- Efficient solution of linear diophantine equations
- A polynomial algorithm for solving systems of two linear diophantine equations
- Avoiding slack variables in the solving of linear diophantine equations and inequations
- A fast method for finding the basis of non-negative solutions to a linear diophantine equation
- Automatic translation of FORTRAN programs to vector form
Cited In (11)
- Symmetric information exchange system based on ring isomorphism
- A note on solving linear Diophantine systems by usingL3-reduction algorithm
- Numerical methods to solve problems on a mathematical safe
- Partitioning a set of vectors with integer coordinates by means of logical hardware
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial method for solving systems of linear constraints
- Solution algorithms for systems of linear equations over residue rings
- Mesh Algorithms for Solving Principal Diophantine Equations, Sand-glass Tubes and Tori of Roots
- Algorithms for solving systems of linear Diophantine equations in residue rings
- Algorithms for solving linear constraints over residue ring
This page was built for publication: Algorithms for solution of systems of linear Diophantine equations in residue fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458039)
