Algorithms for solution of systems of linear Diophantine equations in residue fields
From MaRDI portal
(Redirected from Publication:2458039)
Cites work
- A fast method for finding the basis of non-negative solutions to a linear diophantine equation
- A polynomial algorithm for solving systems of two linear diophantine equations
- Algorithms for solving systems of linear Diophantine equations in integer domains
- Automatic translation of FORTRAN programs to vector form
- Avoiding slack variables in the solving of linear diophantine equations and inequations
- Efficient solution of linear diophantine equations
- Solution of the safe problem on (0,1)-matrices
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
- scientific article; zbMATH DE number 4154522 (Why is no real title available?)
- scientific article; zbMATH DE number 1200746 (Why is no real title available?)
- 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)