Abstract
We investigate self-testing programs with relative error by allowing error terms proportional to the function to be computed. Until now, in numerical computation, error terms were assumed to be either constant or proportional to the p-th power of the magnitude of the input, for p ∈ [0, 1). We construct new self-testers with relative error for realvalued multi-linear functions defined over finite rational domains. The existence of such self-testers positively solves an open question in [KMS99]. Moreover, our self-testers are very efficient: they use few queries and simple operations.
Partially supported by a CNRS-Conicyt’98 Project, ESPRIT Working Group RAND2 No. 21726, and Franco-Hungarian bilateral project Balaton No. 99013.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Ar, M. Blum, B. Codenotti, and P. Gemmell. Checking approximate computations over the reals. In Proc. 25th STOC, pages 786–795, 1993.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractibility of approximation problems. In Proc. 33rd FOCS, pages 14–23, 1992.
S. Arora and S. Safra. Probabilistic checkable proofs: A new characterization of NP. In Proc. 33rd FOCS, pages 1–13, 1992.
L. Babai. Transparent (holographic) proofs. In Proc. 10th STACS, volume 665, pages 525–534. LNCS, 1993.
M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1):269–291, 1995.
M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. J. Comp. and Syst. Sci., pages 549–595, 1993.
M. Blum. Designing programs to check their work. Technical Report 88-009, ICSI, 1988.
D. Coppersmith, December 1989. See discussion in [BLR93].
F. Ergün, S. Ravi Kumar, and R. Rubinfeld. Approximate checking of polynomials and functional equations. In Proc. 37th FOCS, pages 592–601, 1996.
K. Friedl, Z. Hátsági, and A. Shen. Low-degree tests. Proc. 5th SODA, pages 57–64, 1994.
G. L. Forti. Hyers-Ulam stability of functional equations in several variables. Aeq. Mathematicae, 50:143–190, 1995.
O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. In Proc. 37th FOCS, pages 339–348, 1996.
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–42, 1991.
O. Goldreich and D. Ron. Property testing in bounded degree graphs. In Proc. 37th STOC, pages 406–415, 1997.
D. H. Hyers and T. M. Rassias. Approximate homomorphisms. Aeq. Mathematicae, 44:125–153, 1992.
D. H. Hyers and P. Šemrl. On the behaviour of mappings which do not satisfy Hyers-Ulam stability. Proc. AMS, 144(4):989–993, April 1992.
D. H. Hyers. On the stability of the linear functional equation. Proc. Nat. Acad. Sci., U.S.A., 27:222–224, 1941.
M. Kiwi, F. Magniez, and M. Santha. Approximate testing with relative error. In Proc. 31st STOC, pages 51–60, 1999.
R. Lipton. New directions in testing. Series in Discrete Mathematics and Theoretical Computer Science, 2:191–202, 1991.
R. Rubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. SIAM J. Comp., 25(2):23–32, April 1996.
R. Rubinfeld. On the robustness of functional equations. SIAM J. Comp., 28(6):1972–1997, 1999.
F. Skof. Sull’approssimazione delle applicazioni localmente δ-additive. Atti Acc. Sci. Torino, 117:377–389, 1983. in Italian.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Magniez, F. (2000). Multi-linearity Self-Testing with Relative Error. In: Reichel, H., Tison, S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46541-3_25
Download citation
DOI: https://doi.org/10.1007/3-540-46541-3_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67141-1
Online ISBN: 978-3-540-46541-6
eBook Packages: Springer Book Archive