Algorithms for Solving Linear Constraints Over Residue Ring
摘要
The author has proposed algorithms for checking the satisfiability of linear equality constraints in residue rings Zm. He has shown that these algorithms belong to the class of polynomial time complexity.