| Alternate document: Details Self-Testing/Correcting with Applications to Numerical Problems (90) Manuel Blum, Michael Luby, Ronitt Rubinfeld |
Manuel Blum, Michael Luby, Ronitt Rubinfeld  Home/Search
Context Related
| berkeley.edu/~luby...selftestcorrect.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~luby/self (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Suppose someone gives us an extremely fast program P that we can call as a black box to compute a function f . Should we trust that P works correctly? A self-testing/correcting pair for f allows us to: (1) estimate the probability that P (x) 6= f(x) when x is randomly chosen; (2) on any input x, compute f(x) correctly as long as P is not too faulty on average. Furthermore, both (1) and (2) take time only slightly more than the original running time of P . We present general techniques... (Update)
Cited by: More
Testing Hypergraph Coloring - Czumaj, Sohler (2001) (Correct)
Checking Geometric Programs or Verification of Geometric.. - Kurt Mehlhorn Stefan (1996) (Correct)
Highly Resilient Correctors for Polynomials - Peter Gemmell Madhu (1992) (Correct)
Similar documents (at the sentence level):
10.4%: Self-Testing/Correcting with Applications to Numerical.. - Blum, Luby, Rubinfeld (1990) (Correct)
Active bibliography (related documents): More All
1.4: Ranyi, A., (1970), Probability Theory, North-Holland.. - Rosser Schoenfeld.. (1991) (Correct)
0.9: Lower Bounds on Random-Self-Reducibility (Extended Abstract) - Feigenbaum, al. (1990) (Correct)
0.8: Software Reliability via Run-Time Result-Checking - Wasserman, Blum (1994) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.4: Robust Characterizations of Polynomials with Applications to .. - Rubinfeld, Sudan (1996) (Correct)
0.2: Self-Correcting for Function Fields of Finite Transcendental.. - Shahoumian (1995) (Correct)
0.2: Linear Consistency Testing - Aumann, Hastad, Rabin, Sudan (1999) (Correct)
Related documents from co-citation: More All
39: Robust characterization of polynomials with applications to program testing - Rubinfeld, Sudan - 1996
38: Non-deterministic exponential time has twoprover interactive protocols - Babai, Fortnow et al. - 1991
37: Self testingcorrecting polynomial and approximate function - Rubinfeld, Wigderson et al. - 1991
BibTeX entry: (Update)
M. Blum, M. Luby and R. Rubinfeld, Self-testing/correcting with applications to numerical problems. JCSS, 47:549-595, 1994. http://citeseer.ist.psu.edu/blum90selftestingcorrecting.html More
@article{ blum93selftestingcorrecting,
author = "Manuel Blum and Michael Luby and Ronitt Rubinfeld",
title = "Self-Testing/Correcting with Applications to Numerical Problems",
journal = "{Journal of Computer and System Sciences}",
volume = "47",
number = "3",
pages = "549--595",
year = "1993",
url = "citeseer.ist.psu.edu/blum90selftestingcorrecting.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
308 Matrix Multiplication via Arithmetic Progressions (context) - Coppersmith, Winograd - 1987
242 Non-Deterministic Exponential Time has Two-Prover Interactiv.. - Babai, Fortnow et al. - 1990
192 Designing programs that check their work - Blum, Kannan - 1989
173 Trading Group Theory for Randomness (context) - Babai - 1985
168 Gaussian Elimination is not Optimal (context) - Strassen - 1969
132 Hiding Instance in Multioracle Queries (context) - Beaver, Feigenbaum - 1990
88 Approximate formulas for some functions of prime numbers (context) - Rosser, Schoenfeld - 1962
83 Multi-Prover Interactive Proofs: How to Remove Intractabilit.. (context) - Ben-Or, Goldwasser et al. - 1988
68 Monte-Carlo Approximation Algorithms for Enumeration Problem.. (context) - Karp, Luby et al. - 1989
43 Schnelle Multiplikation grosser Zahlen (context) - Schonhage, Strassen
40 Designing programs to check their work (context) - Blum
32 Probability Theory (context) - Renyi - 1970
28 Fast Probabilistic Algorithms (context) - Freivalds - 1979
17 Lower Bounds on Random Self-Reducibility (context) - Feigenbaum, Kannan et al. - 1990
17 Efficient Checkers for Number-Theoretic Computations (context) - Adleman, Huang et al.
13 Self-Testing/Correcting with Applications to Numerical Probl.. - Blum, Luby et al. - 1990
12 IP = PSPACE (context) - Shamir - 1990
10 Program Result Checking with Applications (context) - Kannan - 1990
10 Designing Checkers for Programs that Run in Parallel - Rubinfeld
10 A Note on Self-Testing/Correcting Methods for Trigonometric .. (context) - Cleve, Luby - 1990
7 Self-Testing/Correcting for Polynomials and for Approximate .. - Gemmell, Lipton et al. - 1991
5 A Mathematical Theory of Self-Checking, Self-Testing and Sel.. (context) - Rubinfeld - 1990
3 Self-Testing Polynomial Functions Efficiently and over Ratio.. - Rubinfeld, Sudan - 1992
3 the Complexity of Coherent Sets (context) - Beigel, Feigenbaum - 1990
3 Co-SAT Has Multi-Prover Interactive Proofs (context) - Nisan - 1989
3 Efficient Random Generation of Nonsingular Matrices (context) - Randall - 1991
2 E-mail and the power of interaction (context) - Babai - 1990
2 Convolutions on Groups (context) - Ben-Or, Coppersmith et al.
2 A note on probabilistically verifying integer and polynomial.. (context) - Michael - 1989
2 Coherent Functions and Program Checking (context) - Yao - 1990
1 The Polynomial Hierarchy has Interactive Proofs (context) - Fortnow, Karloff et al. - 1990
1 Batch Checking Linear Functions (context) - Rubinfeld - 1990
1 personal communication through Michael Fischer (context) - Schonhage
1 Program correctness: can one test for it (context) - Blum, Raghavan - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.icsi.berkeley.edu/~luby/self.html):
Program Result Checking Against Adaptive Programs and in.. - Blum, al. (1990) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC