On testing for zero polynomials by a set of points with bounded precision.
From MaRDI portal
Publication:1401255
DOI10.1016/S0304-3975(02)00429-2zbMATH Open1045.68166MaRDI QIDQ1401255FDOQ1401255
Authors: Jin-Yi Cai, Eric Bach 
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- A Fast Monte-Carlo Test for Primality
- Simulating BPP using a general weak random source
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factor Refinement
- Title not available (Why is that?)
Cited In (8)
- A new proximity test for polynomial zeros
- Counting \(r\)-tuples of positive integers with \(k\)-wise relatively prime components
- Use of algebraically independent numbers for zero recognition of polynomial terms.
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
- Verification of a low-degree polynomial vanishing at empirical points
- Title not available (Why is that?)
- Efficient zero location tests for delta-operator-based polynomials
- Title not available (Why is that?)
This page was built for publication: On testing for zero polynomials by a set of points with bounded precision.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401255)
