{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:53:54Z","timestamp":1776106434146,"version":"3.50.1"},"reference-count":41,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0022-0000(93)90044-w","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"549-595","source":"Crossref","is-referenced-by-count":433,"title":["Self-testing\/correcting with applications to numerical problems"],"prefix":"10.1016","volume":"47","author":[{"given":"Manuel","family":"Blum","sequence":"first","affiliation":[]},{"given":"Michael","family":"Luby","sequence":"additional","affiliation":[]},{"given":"Ronitt","family":"Rubinfeld","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90044-W_BIB1","doi-asserted-by":"crossref","unstructured":"L. Adleman, M. Huang, and K. Kompella, Efficient checkers for number-theoretic computations, Inform. and Comput., submitted.","DOI":"10.1006\/inco.1995.1125"},{"key":"10.1016\/0022-0000(93)90044-W_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(93)90044-W_BIB3","series-title":"Proceedings, 17th ACM Symposium on Theory of Computing","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"key":"10.1016\/0022-0000(93)90044-W_BIB4","series-title":"Proceedings, 5th Structures in Complexity Theory Conference","article-title":"E-mail and the power of interaction","author":"Babai","year":"1990"},{"key":"10.1016\/0022-0000(93)90044-W_BIB5","series-title":"Proceedings, 31st IEEE Symposium on Foundations of Computer Science","article-title":"Non-deterministic exponential time has two-prover interactive protocols","author":"Babai","year":"1990"},{"key":"10.1016\/0022-0000(93)90044-W_BIB6","series-title":"Proceedings, Symposium of Theoretical Aspects of Computer Science","article-title":"Hiding instance in multioracle queries","author":"Beaver","year":"1990"},{"key":"10.1016\/0022-0000(93)90044-W_BIB7","article-title":"On the Complexity of Coherent Sets","author":"Beigel","year":"1990","journal-title":"AT & T Technical Memorandum"},{"key":"10.1016\/0022-0000(93)90044-W_BIB8","unstructured":"M. Ben-Or, D. Coppersmith, M. Luby, and R. Rubinfeld, Convolutions on groups, in preparation."},{"key":"10.1016\/0022-0000(93)90044-W_BIB9","series-title":"Proceedings, 20th ACM Symposium on Theory of Computing","first-page":"113","article-title":"Multi-prover interactive proofs: How to remove intractability","author":"Ben-Or","year":"1988"},{"key":"10.1016\/0022-0000(93)90044-W_BIB10","unstructured":"M. Blum, \u201cDegning Programs to Check Their Work\u201d ICSI Technical Report TR-88-009."},{"key":"10.1016\/0022-0000(93)90044-W_BIB11","first-page":"127","article-title":"Program correctness: Can one test for it?","volume":"89","author":"Blum","year":"1989"},{"key":"10.1016\/0022-0000(93)90044-W_BIB12","series-title":"Proceedings, ACM Symposium on Theory of Computing","article-title":"Designing programs that check their work","author":"Blum","year":"1989"},{"key":"10.1016\/0022-0000(93)90044-W_BIB13","series-title":"presented in Distributed Computing and Cryptography Workshop","article-title":"Program result checking against adaptive programs and in cryptographic settings","volume":"Vol. 2","author":"Blum","year":"1991"},{"key":"10.1016\/0022-0000(93)90044-W_BIB14","series-title":"Proceedings, 22nd ACM Symposium on Theory of Computing","article-title":"Self-testing\/correcting with applications to numerical problems","author":"Blum","year":"1990"},{"key":"10.1016\/0022-0000(93)90044-W_BIB15_1","series-title":"Proceedings, of 23rd IEEE Symposium on Foundations of Computer Science","article-title":"How to generate cryptographically strong sequences of pseudo-random bits","author":"Blum","year":"1982"},{"key":"10.1016\/0022-0000(93)90044-W_BIB15_2","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"Blum","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90044-W_BIB16","article-title":"A Note on Self-Testing\/Correcting Methods for Trigonometric Functions","author":"Cleve","year":"1990","journal-title":"ICSI Technical Report TR-90-032"},{"key":"10.1016\/0022-0000(93)90044-W_BIB17","series-title":"Proceedings, 19th ACM Symposium on Theory of Computing","article-title":"Matrix Multiplication via arithmetic progressions","author":"Coppersmith","year":"1987"},{"key":"10.1016\/0022-0000(93)90044-W_BIB18","series-title":"Proceedings, 5th Structures in Complexity Theory Conference","article-title":"Lower bounds on random self-reducibility","author":"Feigenbaum","year":"1990"},{"key":"10.1016\/0022-0000(93)90044-W_BIB19","series-title":"Proceedings of the 31st IEEE Symposium on Foundations of Computer Science","article-title":"The polynomial hierarchy has interactive proofs","author":"Fortnow","year":"1990"},{"key":"10.1016\/0022-0000(93)90044-W_BIB20","series-title":"Mathematical Foundations of CS","first-page":"57","article-title":"Fast probabilistic algorithms","volume":"Vol 74","author":"Freivalds","year":"1979"},{"key":"10.1016\/0022-0000(93)90044-W_BIB21","series-title":"Proceedings of the 23rd ACM Symposium on Theory of Computing","article-title":"Self-testing\/correcting for polynomials and for approximate functions","author":"Gemmell","year":"1991"},{"key":"10.1016\/0022-0000(93)90044-W_BIB22_1","series-title":"17th ACM Symposium on Theory of Computing","article-title":"The knowledge complexity of interactive proof systems","author":"Goldwasser","year":"1985"},{"issue":"No. 1","key":"10.1016\/0022-0000(93)90044-W_BIB22_2","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"Goldwasser","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/0022-0000(93)90044-W_BIB23","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1145\/58562.214082","article-title":"A note on probabilistically verifying integer and polynomial products","volume":"36","author":"Kaminski","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(93)90044-W_BIB24","article-title":"Program Result Checking with Applications","author":"Kannan","year":"1990"},{"issue":"No. 3","key":"10.1016\/0022-0000(93)90044-W_BIB25","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/0196-6774(89)90038-2","article-title":"Monte-Carlo approximation algorithms for enumeration problems","volume":"10","author":"Karp","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(93)90044-W_BIB26","series-title":"Distributed Computing and Cryptography workshop","first-page":"191","article-title":"New directions in testing","volume":"Vol. 2","author":"Lipton","year":"1991"},{"key":"10.1016\/0022-0000(93)90044-W_BIB27","series-title":"Co-SAT Has Multi-Prover Interactive Proofs","author":"Nisan","year":"1989"},{"issue":"No. 1","key":"10.1016\/0022-0000(93)90044-W_BIB28","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/rsa.3240040108","article-title":"Efficient Random Generation of Nonsingular Matrices","volume":"Vol. 4","author":"Randall","year":"1993","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/0022-0000(93)90044-W_BIB29","series-title":"Probability Theory","author":"R\u00e8nyi","year":"1970"},{"key":"10.1016\/0022-0000(93)90044-W_BIB30","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","article-title":"Approximate formulas for some functions of prime numbers","volume":"6","author":"Rosser","year":"1962","journal-title":"Illinois J. Math."},{"key":"10.1016\/0022-0000(93)90044-W_BIB31","unstructured":"R. Rubinfeld, \u201cDesigning Checkers for Programs that Run in Parallel,\u201d ICSI Technical Report TR-90-040."},{"key":"10.1016\/0022-0000(93)90044-W_BIB32","series-title":"Batch checking linear functions","author":"Rubinfeld","year":"1990"},{"key":"10.1016\/0022-0000(93)90044-W_BIB33","article-title":"A Mathematical Theory of Self-Checking, Self-Testing and Self-Correcting Programs","author":"Rubinfeld","year":"1990"},{"key":"10.1016\/0022-0000(93)90044-W_BIB34","series-title":"Proceedings, ACM SIAM Symposium on Discrete Algorithms","article-title":"Self-testing polynomial functions efficiently and over rational domains","author":"Rubinfeld","year":"1992"},{"key":"10.1016\/0022-0000(93)90044-W_BIB35","unstructured":"A. Sch\u00f6nhage, personal communication through Michael Fischer."},{"key":"10.1016\/0022-0000(93)90044-W_BIB36","doi-asserted-by":"crossref","unstructured":"A. Sch\u00f6nhage and V. Strassen Schnelle Multiplikation grosser Zahlen, Computing7, 281\u2013292.","DOI":"10.1007\/BF02242355"},{"key":"10.1016\/0022-0000(93)90044-W_BIB37","series-title":"Proceedings, 31st IEEE Symposium on Foundations of Computer Science","article-title":"IP = PSPACE","author":"Shamir","year":"1990"},{"key":"10.1016\/0022-0000(93)90044-W_BIB38","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numer. Math."},{"key":"10.1016\/0022-0000(93)90044-W_BIB39","series-title":"Proceedings, 22nd ACM Symposium on Theory of Computing","article-title":"Coherent functions and program checking","author":"Yao","year":"1990"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390044W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390044W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T16:20:20Z","timestamp":1585326020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390044W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["002200009390044W"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90044-w","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}