{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:53:57Z","timestamp":1775282037539,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00429-2","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T17:35:20Z","timestamp":1045071320000},"page":"15-25","source":"Crossref","is-referenced-by-count":4,"title":["On testing for zero polynomials by a set of points with bounded precision"],"prefix":"10.1016","volume":"296","author":[{"given":"Jin-Yi","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Bach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00429-2_BIB1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1006\/jagm.1993.1038","article-title":"Factor refinement","volume":"15","author":"Bach","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(02)00429-2_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","article-title":"On a problem of Oppenheim concerning \u201cfactorisatio numerorum\u201d","volume":"17","author":"Canfield","year":"1983","journal-title":"J. Number Theory"},{"key":"10.1016\/S0304-3975(02)00429-2_BIB3","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/S0097539793250330","article-title":"Randomness-optimal unique element isolation with application to perfect matching and related problems","volume":"24","author":"Chari","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00429-2_BIB4","unstructured":"Z. Chen, Personal communication."},{"key":"10.1016\/S0304-3975(02)00429-2_BIB5","doi-asserted-by":"crossref","unstructured":"Z. Chen, M. Kao, Reducing randomness via irrational numbers, in: Proc. 29th ACM STOC, 1997, pp. 200\u2013209.","DOI":"10.1145\/258533.258583"},{"key":"10.1016\/S0304-3975(02)00429-2_BIB6","series-title":"Algebra","author":"Lang","year":"1971"},{"key":"10.1016\/S0304-3975(02)00429-2_BIB7","series-title":"Fundamentals of Computing Theory","article-title":"On determinants, matchings and random algorithms","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0304-3975(02)00429-2_BIB8","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","article-title":"Riemann's hypothesis and tests for primality","volume":"13","author":"Miller","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00429-2_BIB9","series-title":"Proc. Computational Complexity","first-page":"44","article-title":"Extracting randomness","author":"Nisan","year":"1996"},{"key":"10.1016\/S0304-3975(02)00429-2_BIB10","unstructured":"C. Pomerance, Multiplicative independence for random integers, in: B.C. Berndt et al. (Eds.), Analytic Number Theory, vol. 2: Proceedings of a Conference in Honor of Heini Halberstam, Birkh\u00e4user, Boston, 1996, pp. 703\u2013711."},{"key":"10.1016\/S0304-3975(02)00429-2_BIB11","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","article-title":"Probabilistic algorithm for testing primality","volume":"12","author":"Rabin","year":"1980","journal-title":"J. Number Theory"},{"key":"10.1016\/S0304-3975(02)00429-2_BIB12","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","article-title":"Fast probabilistic algorithms for verification of polynomial identities","volume":"27","author":"Schwartz","year":"1980","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0304-3975(02)00429-2_BIB13","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A fast Monte-Carlo test for primality","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00429-2_BIB14","first-page":"216","article-title":"Probabilistic algorithms for sparse polynomials","volume":"vol. 72","author":"Zippel","year":"1979"},{"key":"10.1016\/S0304-3975(02)00429-2_BIB15","doi-asserted-by":"crossref","unstructured":"D. Zuckerman, Simulating BPP using a general weak random source, Algorithmica, vol. 16, 1996, pp. 367\u2013391.","DOI":"10.1007\/BF01940870"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004292?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004292?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T08:50:49Z","timestamp":1553935849000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502004292"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00429-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}