{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:06:05Z","timestamp":1648926365731},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Comput"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1007\/bf02425916","type":"journal-article","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T11:35:57Z","timestamp":1149680157000},"page":"139-145","source":"Crossref","is-referenced-by-count":0,"title":["Self-correcting polynomial programs"],"prefix":"10.1007","volume":"2","author":[{"given":"Guevara","family":"Noubir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henri J.","family":"Nussbaumer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02425916_CR1","unstructured":"Blum, M. et al.Self-testing and self-correcting programs, with applications to numerical programs. In: \u201cProceedings of the 22th ACM STOC\u201990\u201d."},{"key":"BF02425916_CR2","doi-asserted-by":"crossref","unstructured":"Lipton, R. J.New directions in testing. In: \u201cDistributed Computing and Cryptography\u201d, volume 2 of DIMACS, ACM AMS, 1991.","DOI":"10.1090\/dimacs\/002\/13"},{"key":"BF02425916_CR3","unstructured":"Noubir, G. and Nussbaumer, H. J.Self-correcting polynomials. Swiss Federal Insitute of Technology in Lausanne, CS-TR-95\/151."},{"key":"BF02425916_CR4","doi-asserted-by":"crossref","unstructured":"Nussbaumer, H. J.Fast Fourier transform and convolution algorithms. Springer Series in Information Science, Springer-Verlag, 1982.","DOI":"10.1007\/978-3-642-81897-4"},{"key":"BF02425916_CR5","unstructured":"Rubinfeld, R. et al.Self-testing\/correcting for polynomials and for approximate functions. In: \u201cProceedings of the 23rd ACM STOC\u201991\u201d."},{"key":"BF02425916_CR6","unstructured":"Sudan, M.Efficient checking of polynomials and proofs and the hardness of approximation problems. Ph.D. Thesis, University of California at Berkeley, 1992."}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BF02425916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T06:57:54Z","timestamp":1555657074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02425916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF02425916"],"URL":"https:\/\/doi.org\/10.1007\/bf02425916","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"value":"1385-3139","type":"print"},{"value":"1573-1340","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}