On testing for zero polynomials by a set of points with bounded precision.

DOI10.1016/S0304-3975(02)00429-2zbMath1045.68166MaRDI QIDQ1401255

Jin-Yi Cai, Eric Bach

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

DerandomizationIdentity testingMultiplicative dependence

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (1)

Counting \(r\)-tuples of positive integers with \(k\)-wise relatively prime components

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

This page was built for publication: On testing for zero polynomials by a set of points with bounded precision.