On testing for zero polynomials by a set of points with bounded precision.
type: Item
instance of: scholarly article
title: On testing for zero polynomials by a set of points with bounded precision.
zbMATH Open document ID: 1045.68166
DOI: 10.1016/S0304-3975(02)00429-2
author: Jin-Yi Cai
author: Eric Bach
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 1965286
zbMATH Keywords: Derandomization
zbMATH Keywords: Identity testing
zbMATH Keywords: Multiplicative dependence
MaRDI profile type: Publication
cites work: Factor Refinement
cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum''
cites work: Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
cites work: Q4526983
cites work: Q3891767
cites work: Riemann's hypothesis and tests for primality
cites work: Q4885335
cites work: Probabilistic algorithm for testing primality
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: A Fast Monte-Carlo Test for Primality
cites work: Q3851616
cites work: Simulating BPP using a general weak random source
description: scientific article; zbMATH DE number 1965286