{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T00:10:23Z","timestamp":1742602223408,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631651"},{"type":"electronic","value":"9783540691945"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63165-8_178","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:10:37Z","timestamp":1330297837000},"page":"203-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Checking properties of polynomials"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Codenotti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Funda","family":"Erg\u00fcn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Gemmell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Ravi","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"S. Ar, M. Blum, B. Codenotti, and P. Gemmell. Checking approximate computations over the reals. Proc. 25th STOC, pp. 786\u2013795, 1993.","DOI":"10.1145\/167088.167288"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. Proc. 33rd FOCS, pp. 14\u201323, 1992.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Proc. 33rd FOCS, pp. 2\u201313, 1992.","DOI":"10.1109\/SFCS.1992.267824"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"M. Blum. Designing programs to check their work. TR 88-009, ICSI, 1988.","DOI":"10.1145\/73007.73015"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"M. Blum and S. Kannan. Program correctness checking ... and the design of programs that check their work. Proc. 21st STOC, pp. 86\u201397, 1989.","DOI":"10.1145\/73007.73015"},{"issue":"3","key":"20_CR6","first-page":"549","volume":"47","author":"M. Blum","year":"1993","unstructured":"M. Blum, M. Luby, and R. Rubinfeld. Self-testing\/correcting with applications to numerical problems. JCSS, 47(3):549\u2013595, 1993.","journal-title":"JCSS"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"B. Buchberger, G.E. Collins, and R. Loos. Computer Algebra \u2014 Symbolic and Algebraic Computation. Springer-Verlag, 1982.","DOI":"10.1007\/978-3-7091-3406-1"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"J.B. Conway. Functions of One Complex Variable. Springer-Verlag, 1978.","DOI":"10.1007\/978-1-4612-6313-5"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"F. Erg\u00fcn. Testing multivariate linear functions: Overcoming the generator bottleneck. Proc. 27th STOC, pp. 407\u2013416, 1995.","DOI":"10.1145\/225058.225167"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"R. Freivalds. Fast probabilistic algorithms. Proc. 8th MFCS, LNCS 74, pp. 57\u201369, 1979.","DOI":"10.1007\/3-540-09526-8_5"},{"key":"20_CR11","unstructured":"F. Erg\u00fcn, S. Ravi Kumar, and R. Rubinfeld. Approximate checking of polynomials and functional equations. Proc. 37th FOCS, To appear."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-testing\/correcting for polynomials and for approximate functions. Proc. 23rd STOC, pp. 32\u201342, 1991.","DOI":"10.1145\/103418.103429"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Proc. 37th FOCS, pp. 339\u2013348, 1996.","DOI":"10.1109\/SFCS.1996.548493"},{"key":"20_CR14","unstructured":"G.H. Golub and C. Van Loan. Matrix Computations. Johns Hopkins U. Press, 1989."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/355626.355632","volume":"1","author":"M.A. Jenkins","year":"1975","unstructured":"M.A. Jenkins and J.F. Traub. Principles for testing polynomial zero-finding programs. ACM Trans. on Mathematical Software, 1:26\u201334, 1975.","journal-title":"ACM Trans. on Mathematical Software"},{"key":"20_CR16","volume-title":"PhD thesis","author":"S. Kannan","year":"1990","unstructured":"S. Kannan. Program Result Checking with Applications. PhD thesis, U. of California at Berkeley, 1990."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"R. Lipton. New directions in testing. Proc. DIMACS Workshop on Distributed Computing and Cryptography, pp. 191\u2013202,1991.","DOI":"10.1090\/dimacs\/002\/13"},{"key":"20_CR18","unstructured":"M. Marden. Geometry of Polynomials. AMS, 1966."},{"key":"20_CR19","unstructured":"W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C. Cambridge U. Press, 1992."},{"issue":"2","key":"20_CR20","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"R. Rubinfeld and M. Sudan. Robust characterizations of polynomials and their applications to program testing. SICOMP, 25(2):252\u2013271, 1996.","journal-title":"SICOMP"},{"key":"20_CR21","unstructured":"J. H. Wilkinson. The Algebraic Eigenvalue Problem. Clarendon Press, 1966."},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"R.E. Zippel. Effective Polynomial Computation. Kluwer Academic Press, 1993.","DOI":"10.1007\/978-1-4615-3188-3"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63165-8_178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:38:19Z","timestamp":1742600299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63165-8_178"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631651","9783540691945"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-63165-8_178","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}