(Enter summary)
Abstract: In the late 80's Blum, Luby, Rubinfeld, Kannan et al. pioneered the theory of self--testing as an alternative way of dealing with the problem of software reliability. Over the last decade this theory played a crucial role in the construction of probabilistically checkable proofs and the derivation of hardness of approximation results. Applications in areas like computer vision, machine learning, and self--correcting programs were also established. In the self-testing problem one is interested... (Update)
Context of citations to this paper: More
...they are still waiting to be investigated. The interested reader is also referred to other surveys of this and related elds, such as [41] [33] and [27] 9.1 Other works concerning testability As is the case with all surveys, this one could not cover anything and everything in...
...and p min = min 1#i#n p i . We also remark that the result of [25] is a Lee norm analogue of Hamming norm results of [2, 7, 10, 11, 16, 19, 22, 24, 25, 26, 27] on noisy polynomial reconstruction problem and algebraic geometry codes list decoding. Finally, several possible...
Cited by: More
Playing "Hide-and-Seek" in Finite Fields: The Hidden Number.. - Shparlinski (2002)
(Correct)
Noisy Chinese Remaindering in the Lee Norm - Shparlinski, Steinfeld (2002)
(Correct)
The art of uninformed decisions: A primer to property testing - Fischer (2001)
(Correct)
Active bibliography (related documents): More All
0.2: A Characterization of Easily Testable Induced Subgraphs - Alon, Shapira (2004)
(Correct)
0.2: Property Testing: Theory and Applications - Raskhodnikova (2003)
(Correct)
0.2: Quantum Property Testing - Buhrman, Fortnow, Newman, Röhrig (2004)
(Correct)
Similar documents based on text: More All
0.3: Approximate Testing with Relative Error - Kiwi, Magniez, Santha (1999)
(Correct)
0.3: Self-Testing Without The Generator Bottleneck - Ergün, Kumar, Sivakumar
(Correct)
0.2: Multi-Linearity Self-Testing with Relative Error - Magniez
(Correct)
Related documents from co-citation: More All
2: The two faces of lattices in cryptology
- Nguyen, Stern - 2001
2: Finding smooth integers in short intervals using CRT decoding
- Boneh - 2000
2: Soft-decision (context) - Guruswami, Sahai et al. - 2000
BibTeX entry: (Update)
M. Kiwi, F. Magniez and M. Santha, Exact and approximate testing/correcting of algebraic functions: A survey, manuscript (available as ECCC TR01-014). http://citeseer.ist.psu.edu/406802.html More
@article{ kiwi01exact,
author = "Marcos A. Kiwi and Fr\'ed\'eric Magniez and Miklos Santha",
title = "Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
number = "014",
year = "2001",
url = "citeseer.ist.psu.edu/406802.html" }
Citations (may not include all citations):
173
Proof verification and intractability of approximation probl.. (context) - Arora, Lund et al. - 1992
33
Regular languages are testable with a constant number of que..
- Alon, Krivelevich et al. - 1999
23
Checking approximate computations over the reals
- Ar, Blum et al. - 1993
18
Testing clustering
- Alon, Dar et al. - 2000
5
cient testing of large graphs (context) - Alon, Fischer et al. - 1999
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