Abstract
A polynomial algorithm is proposed to construct the minimal generating set of solutions and the basis of the solution set for systems of linear Diophantine equations over the ring of integer. The algorithm is based on a modified TSS method.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
