Zero testing of p-adic and modular polynomials

Marek Karpinski, Alf Van Der Poorten, Igor Shparlinski

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)309-317
Number of pages9
JournalTheoretical Computer Science
Volume233
Issue number1-2
Publication statusPublished - 28 Feb 2000

Fingerprint Dive into the research topics of 'Zero testing of p-adic and modular polynomials'. Together they form a unique fingerprint.

Cite this