Checking approximate computations over the reals

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 786-795

  Ar, S ^a   Blum, M ^b   Codenotti, B ^c   Gemmell, P ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; LINEAR SYSTEMS; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; FUNCTION EVALUATION; PROGRAM DEBUGGING; RANDOM PROCESSES; REAL TIME SYSTEMS;

APPROXIMATE COMPUTATION; FINITE FIELDS; IDENTICALLY DISTRIBUTED RANDOM VARIABLES; LINEAR SYSTEM SOLUTION; MATRIX INVERSIONS; MATRIX MULTIPLICATION; NUMERICAL COMPUTATIONS;

MATRIX ALGEBRA; COMPUTER SOFTWARE;

BEIGEL'S TRICK; CHECKING COMPUTATIONS;

EID: 0027206124     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167288     Document Type: Conference Paper

References (14)

1. R. Beigel. Personal communication to Manuel Blum; see [2].
2. M. Blum. Designing Programs to Check their Work. ICSI TR-88-009, 1988.
3. M. Blum, S. Kannan. Designing Programs that Check their Work. In Proc. 21st ACM Symposium on Theory of Computing, 1989.
4. M. Blum, M. Luby and R. Rubinfeld. Self-Testing/Correcting with Applications to Numer-ical Problems. In Proc. 22nd ACM Symposium on Theory of Computing, 1990.
5. R. Cleve, M. Luby. A Note on Self-Testing/Correcting Methods for Trigonometric Functions. ICSI TR-90-032, July 1990.
6. D. Coppersmith and S. Winograd. Matrix multi-plication via arithmetic progression. In Proc. 19th Annual ACM Symposium on Theory of Comput-ing, pages 1-6, Berkeley, CA, 1987.
7. R. Freivalds. Fast probabilistic algorithms. Springer Verlag Lecture Notes in CS, Vol. 74, 57 69, 1979.
8. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan and A. Wigderson. Self-Testing/Correcting for Polynomials and for Approximate Functions. In Proc. 23rd ACM Symposium on Theory of Computing, 1991.
9. G. H. Golub and C. F. van Loan. Matrix Com-putations. Johns Hopkins University Press, Bal-Timore, Md, 1983.
10. S. Kannan. Program Checkers for Algebraic Problems. ICSI TR-89-064, 1989.
11. R. Kannan, A.K. Lenstra, L. Lovasz. Polynomial factorization snd nonrandomness of bits of alge-braic and some transcendental numbers. In Proc. 16th ACM Symposium on Theory of Computing, 1984.
12. R. Lipton. New Directions in Testing. In Distrib. Comput. and Cryptography, DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, pages 191-202, 1991.
13. D. Randall. Efficient random Generation of Invertible Matrices, personal communication.
14. R. Rubinfeld. A mathematical theory of Self- Checking, Self-Testing, and Self-Correcting Pro-grams. PhD Thesis, UC Berkeley, and ICSI TR- 90-054, 1990.