P-adic constraint solving

Andreas Dolzmann, Thomas Sturm
1999 Proceedings of the 1999 international symposium on Symbolic and algebraic computation - ISSAC '99  
We automatically cheek for t.lie feasibility of arbitrary hoolcan cou~hinatious of IiIICilr parametric p-adic coustraints using a quant.ifier elimination nwthotl. This call bc do11e uniforrrily for all 13. wi: focus on the necessary sinlplification methods. Our method is inlplenwnted within the conlputer algchra syst,ent Hll)lrCE. We illustrate the applical)ilit\: of this irripletricnt,a.tion to uon-t,rivial problems iucludiug the solution of systenis of linear congruences over the integers.
doi:10.1145/309831.309894 dblp:conf/issac/DolzmannS99 fatcat:u2hptbxbtjhpvednmq6ta6ajuu