Eldar Fischer  Home/Search
Context Related
| nec.com/homepages/fortnow...column75.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: nec.com/homepages/fortnow/beat... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Property testing is a new field in computational theory, that deals with the information that can be deduced from the input where the number of allowable queries (reads from the input) is significally smaller than its size. (Update)
Cited by: More
Some 3CNF Properties are Hard to Test - Ben-Sasson, Harsha, Raskhodnikova (2003) (Correct)
Monotonicity Testing over General Poset Domains.. - Fischer, Lehman.. (2002) (Correct)
Property Testing: Theory and Applications - Raskhodnikova (2003) (Correct)
Active bibliography (related documents): More All
1.5: Distribution-Free Property Testing - Halevy, Kushilevitz (Correct)
0.8: Quantum Property Testing - Buhrman, Fortnow, Newman, Röhrig (2004) (Correct)
0.8: Functions That Have Read-Twice Constant Width Branching.. - Fischer, Newman, Sgal (2003) (Correct)
Similar documents based on text: More All
0.1: On the Strength of Comparisons in Property Testing - Fischer (Correct)
0.1: Property Testing and its Connection to Learning and.. - Goldreich, Goldwasser, Ron (1998) (Correct)
0.1: Cost of Crime: A Review of the Research Studies - Shapiro (1999) (Correct)
Related documents from co-citation: More All
13: Property testing and its connection to learning and approximation - Goldreich, Goldwasser et al.
12: Property testing - Ron - 2000
12: Robust characterization of polynomials with applications to program testing - Rubinfeld, Sudan - 1996
BibTeX entry: (Update)
Fischer, E. The art of uninformed decisions: A primer to property testing. Bulletin of the European Association for Theoretical Computer Science 75 (Oct. 2001), 97-126. The Computational Complexity Column. http://citeseer.ist.psu.edu/fischer01art.html More
@article{ fischer01art,
author = "Fischer",
title = "The Art of Uninformed Decisions: {A} Primer to Property Testing",
journal = "BEATCS: Bulletin of the European Association for Theoretical Computer Science",
volume = "75",
year = "2001",
url = "citeseer.ist.psu.edu/fischer01art.html" }
Citations (may not include all citations):951 Computational complexity (context) - Papadimitriou - 1994
212 Probabilistic checking of proofs: A new characterization of .. - Arora, Safra - 1992
167 Property testing and its connection to learning and approxim.. - Goldreich, Goldwasser et al. - 1996
115 Robust characterization of polynomials with applications to .. - Rubinfeld, Sudan - 1993
94 Self testingcorrecting with application to numerical problem - Luby, testing et al. - 1990
82 Improved low-degree testing and its applications - Arora, Sudan - 1997
69 Property testing in bounded degree graphs - Goldreich, Ron - 1997
61 Proof veri cation and the hardness of approximation problems - Arora, Lund et al. - 1992
51 Quick approximation to matrices and applications - Frieze, Kannan - 1999
43 Self testingcorrecting polynomial and approximate function - Rubinfeld, Wigderson et al.
36 Regular partitions of graphs (context) - Szemer - 1978
33 Regular languages are testable with a constant number of que.. - Alon, Krivelevich et al. - 2001
24 Property testing - Ron - 2001
21 edi's Regularity Lemma and its applications in graph theory (context) - Koml, Simonovits - 1996
19 Fast Monte-Carlo algorithms for nding low-rank approximation.. (context) - Frieze, Kannan et al. - 1998
19 Ecient testing of large graphs - Alon, Fischer et al. - 2000
18 Testing of clustering - Alon, Dar et al. - 2000
16 On graphs with small subgraphs of large chromatic number (context) - odl, Duke - 1985
14 Property testing in computational geometry (context) - Czumaj, Sohler et al. - 2000
13 Testing subgraphs in large graphs (context) - Alon - 2001
12 the robustness of functional equations - Rubinfeld - 1999
12 On sets of integers which contain no three terms in arithmet.. (context) - Behrend - 1946
12 Lower bounds of tower type for Szemeredi's Uniformity Lemma (context) - Gowers - 1997
12 Testing that distributions are close - Batu, Fortnow et al. - 2000
11 Testing graphs for colorability properties - Fischer - 2001
11 Testing of functions that have small width branching program.. - Newman - 2000
9 Lecture notes on evasiveness of graph properties (context) - Lov, Young - 1994
9 Testing of matrix properties - Fischer, Newman - 2001
8 the strength of comparisons in property testing - Fischer
7 On testing expansion in bounded-degree graphs - Goldreich, Ron
7 Improved testing algorithms for monotonicity - Dodis, Goldreich et al. - 1999
6 towards a uni ed measure of complexity (context) - Yao, computation - 1977
6 Sampling algorithms: Lower bounds and applications (context) - Bar-Yossef, Kumar et al. - 2001
5 Testing metric properties - Parnas, Ron
5 Fast approximation PCPs for multidimensional binpacking prob.. (context) - Batu, Rubinfeld et al. - 1999
3 Fast approximate PCPs (context) - Erg, Kumar et al. - 1999
3 Testing polynomial functions eciently and over rational doma.. (context) - Rubinfeld, Sudan - 1992
3 Combinatorial property testing { a survey - Goldreich - 1998
3 Exact and approximate testingcorrecting algebraic function s.. - Magniez, Exact et al.
2 Quantum property testing - Buhrman, Fortnow et al.
2 Testing parenthesis languages - Parnas, Ron et al. - 2001
2 Testing random variables for independence and identity - Batu, Fischer et al. - 2001
1 a preliminary version written by the rst four authors appear.. (context) - Goldreich, Goldwasser et al. - 1998
1 A function that has read-twice small width branching program.. (context) - Fischer, Newman
1 Samorodnitsky and M (context) - Fischer, Lehman et al.
1 a preliminary version appeared (context) - Erg, Kannan et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://external.nj.nec.com/homepages/fortnow/beatcs/): More
The Computational Complexity Column - Fortnow (Correct)
On Regularity-Preserving Functions - Kozen (1995) (Correct)
On IP = PSPACE and Theorems with Narrow Proofs - Hartmanis, Chang, Ranjan.. (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