We obtain new algorithms for testing whether a given by a black box multivariate polynomial over p-adic fields given by a black box is identical to zero. We also remark on the zero testing of polynomials in residue rings. Our results complement a known results on the zero testing of polynomials over the integers, the rationals, and over finite fields.
|Number of pages||9|
|Journal||Theoretical Computer Science|
|Publication status||Published - 28 Feb 2000|