On testing for zero polynomials by a set of points with bounded precision.
From MaRDI portal
Publication:1401255
DOI10.1016/S0304-3975(02)00429-2zbMath1045.68166MaRDI QIDQ1401255
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Cites Work
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- Simulating BPP using a general weak random source
- Factor Refinement
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- A Fast Monte-Carlo Test for Primality
- Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item