{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:00:50Z","timestamp":1778292050297,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671411","type":"print"},{"value":"9783540465416","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/3-540-46541-3_25","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"302-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-linearity Self-Testing with Relative Error"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Magniez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"S. Ar, M. Blum, B. Codenotti, and P. Gemmell. Checking approximate computations over the reals. In Proc. 25th STOC, pages 786\u2013795, 1993.","DOI":"10.1145\/167088.167288"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractibility of approximation problems. In Proc. 33rd FOCS, pages 14\u201323, 1992.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"S. Arora and S. Safra. Probabilistic checkable proofs: A new characterization of NP. In Proc. 33rd FOCS, pages 1\u201313, 1992.","DOI":"10.1109\/SFCS.1992.267824"},{"key":"25_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/3-540-56503-5_52","volume-title":"Proc. 10th STACS","author":"L. Babai","year":"1993","unstructured":"L. Babai. Transparent (holographic) proofs. In Proc. 10th STACS, volume 665, pages 525\u2013534. LNCS, 1993."},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M. Blum","year":"1995","unstructured":"M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1):269\u2013291, 1995.","journal-title":"J. ACM"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"M. Blum, M. Luby, and R. Rubinfeld. Self-testing\/correcting with applications to numerical problems. J. Comp. and Syst. Sci., pages 549\u2013595, 1993.","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"25_CR7","unstructured":"M. Blum. Designing programs to check their work. Technical Report 88-009, ICSI, 1988."},{"key":"25_CR8","unstructured":"D. Coppersmith, December 1989. See discussion in [BLR93]."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"F. Erg\u00fcn, S. Ravi Kumar, and R. Rubinfeld. Approximate checking of polynomials and functional equations. In Proc. 37th FOCS, pages 592\u2013601, 1996.","DOI":"10.1109\/SFCS.1996.548518"},{"key":"25_CR10","unstructured":"K. Friedl, Z. H\u00e1ts\u00e1gi, and A. Shen. Low-degree tests. Proc. 5th SODA, pages 57\u201364, 1994."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01831117","volume":"50","author":"G. L. Forti","year":"1995","unstructured":"G. L. Forti. Hyers-Ulam stability of functional equations in several variables. Aeq. Mathematicae, 50:143\u2013190, 1995.","journal-title":"Aeq. Mathematicae"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. In Proc. 37th FOCS, pages 339\u2013348, 1996.","DOI":"10.1109\/SFCS.1996.548493"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Selftesting\/correcting for polynomials and for approximate functions. In Proc. 23rd STOC, pages 32\u201342, 1991.","DOI":"10.1145\/103418.103429"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich and D. Ron. Property testing in bounded degree graphs. In Proc. 37th STOC, pages 406\u2013415, 1997.","DOI":"10.1145\/258533.258627"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01830975","volume":"44","author":"D. H. Hyers","year":"1992","unstructured":"D. H. Hyers and T. M. Rassias. Approximate homomorphisms. Aeq. Mathematicae, 44:125\u2013153, 1992.","journal-title":"Aeq. Mathematicae"},{"issue":"4","key":"25_CR16","first-page":"989","volume":"144","author":"D. H. Hyers","year":"1992","unstructured":"D. H. Hyers and P. \u0160emrl. On the behaviour of mappings which do not satisfy Hyers-Ulam stability. Proc. AMS, 144(4):989\u2013993, April 1992.","journal-title":"Proc. AMS"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1073\/pnas.27.4.222","volume":"27","author":"D. H. Hyers","year":"1941","unstructured":"D. H. Hyers. On the stability of the linear functional equation. Proc. Nat. Acad. Sci., U.S.A., 27:222\u2013224, 1941.","journal-title":"Proc. Nat. Acad. Sci., U.S.A."},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"M. Kiwi, F. Magniez, and M. Santha. Approximate testing with relative error. In Proc. 31st STOC, pages 51\u201360, 1999.","DOI":"10.1145\/301250.301269"},{"key":"25_CR19","first-page":"191","volume":"2","author":"R. Lipton","year":"1991","unstructured":"R. Lipton. New directions in testing. Series in Discrete Mathematics and Theoretical Computer Science, 2:191\u2013202, 1991.","journal-title":"Series in Discrete Mathematics and Theoretical Computer Science"},{"issue":"2","key":"25_CR20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"R. Rubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. SIAM J. Comp., 25(2):23\u201332, April 1996.","journal-title":"SIAM J. Comp."},{"issue":"6","key":"25_CR21","doi-asserted-by":"publisher","first-page":"1972","DOI":"10.1137\/S0097539796298625","volume":"28","author":"R. Rubinfeld","year":"1999","unstructured":"R. Rubinfeld. On the robustness of functional equations. SIAM J. Comp., 28(6):1972\u20131997, 1999.","journal-title":"SIAM J. Comp."},{"key":"25_CR22","first-page":"377","volume":"117","author":"F. Skof","year":"1983","unstructured":"F. Skof. Sull\u2019approssimazione delle applicazioni localmente \u03b4-additive. Atti Acc. Sci. Torino, 117:377\u2013389, 1983. in Italian.","journal-title":"Atti Acc. Sci. Torino"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:56:10Z","timestamp":1737341770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}