On testing for zero polynomials by a set of points with bounded precision.
From MaRDI portal
(Redirected from Publication:1401255)
Recommendations
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3698383 (Why is no real title available?)
- scientific article; zbMATH DE number 1559535 (Why is no real title available?)
- scientific article; zbMATH DE number 903721 (Why is no real title available?)
- A Fast Monte-Carlo Test for Primality
- Factor Refinement
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Probabilistic algorithm for testing primality
- Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
- Riemann's hypothesis and tests for primality
- Simulating BPP using a general weak random source
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
- scientific article; zbMATH DE number 1775429 (Why is no real title available?)
- Efficient zero location tests for delta-operator-based polynomials
- scientific article; zbMATH DE number 1796989 (Why is no real title available?)
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)
