Abstract
In this paper, we introduce a new self-correction algorithm that requires less queries than the simple majority vote. We also introduce new random self-reducibility formulas.
Abstract
Предлагается новый алгоритм автокоррекции, требующий меныпего количества ироверок, чем простое принятне рещения большинством голосов. Вводятся также новые формулы случайной автосводимости.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blum, M. et al.Self-testing and self-correcting programs, with applications to numerical programs. In: “Proceedings of the 22th ACM STOC’90”.
Lipton, R. J.New directions in testing. In: “Distributed Computing and Cryptography”, volume 2 of DIMACS, ACM AMS, 1991.
Noubir, G. and Nussbaumer, H. J.Self-correcting polynomials. Swiss Federal Insitute of Technology in Lausanne, CS-TR-95/151.
Nussbaumer, H. J.Fast Fourier transform and convolution algorithms. Springer Series in Information Science, Springer-Verlag, 1982.
Rubinfeld, R. et al.Self-testing/correcting for polynomials and for approximate functions. In: “Proceedings of the 23rd ACM STOC’91”.
Sudan, M.Efficient checking of polynomials and proofs and the hardness of approximation problems. Ph.D. Thesis, University of California at Berkeley, 1992.
Author information
Authors and Affiliations
Additional information
© G. Noubir, H. J. Nussbaumer, 1996
Rights and permissions
About this article
Cite this article
Noubir, G., Nussbaumer, H.J. Self-correcting polynomial programs. Reliable Comput 2, 139–145 (1996). https://doi.org/10.1007/BF02425916
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02425916