Zero testing of \(p\)-adic and modular polynomials
From MaRDI portal
Publication:1575936
DOI10.1016/S0304-3975(99)00133-4zbMath1012.11111WikidataQ56212633 ScholiaQ56212633MaRDI QIDQ1575936
Marek Karpinski, Alfred J. van der Poorten, Igor E. Shparlinski
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials (11S05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero testing of algebraic functions
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- The complexity of sparse polynomial interpolation over finite fields
- On some approximation problems concerning sparse polynomials over finite fields
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
- Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Zeros of p -Adic Exponential Polynomials II
- On the number of zeros of exponential polynomials and related questions
- Computational Complexity of Sparse Rational Interpolation
This page was built for publication: Zero testing of \(p\)-adic and modular polynomials