Journal Article10.1002/RSA.20582
Two-sided error proximity oblivious testing
Oded Goldreich,Igor Shinkar +1 more
TL;DR: In this article, the two-sided error version of proximity-oblivious testers is studied and shown to be more powerful than one-sided fault proximity oblivious testers in many natural properties.
read more
Abstract: The foregoing notion, introduced by Goldreich and Ron STOC 2009, was originally defined with respect to c = 1, which corresponds to one-sided error proximity-oblivious testing. Here we study the two-sided error version of proximity-oblivious testers; that is, the general case of arbitrary c i¾? 0,1]. We show that, in many natural cases, two-sided error proximity-oblivious testers are more powerful than one-sided error proximity-oblivious testers; that is, many natural properties that have no one-sided error proximity-oblivious testers do have a two-sided error proximity-oblivious tester. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 48, 341-383, 2016
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Property Testing and its connection to Learning and Approximation
TL;DR: In this paper, the authors consider the question of determining whether a function f has property P or is e-far from any function with property P. In some cases, it is also allowed to query f on instances of its choice.
873
•Book
Introduction to Property Testing
Oded Goldreich
- 01 Nov 2017
TL;DR: In this article, a wide range of algorithmic techniques for the design and analysis of tests for algebraic properties, properties of Boolean functions, graph properties, and properties of distributions are presented.
440
On Sample-Based Testers
Oded Goldreich,Dana Ron +1 more
TL;DR: This work advances the study of sample-based property testers by providing several general positive results as well as by revealing relations between variants of this testing model, and shows that certain types of query-based testers yield sample- based testers of sublinear sample complexity.
49
Erasure-Resilient Property Testing
TL;DR: This work begins a study of property testers that are resilient to the presence of adversarially erased function values and identifies an $\alpha$-erasure-resilient $\var...$ that is resistant to being erased by an adversary.
Relating two property testing models for bounded degree directed graphs
Artur Czumaj,Pan Peng,Christian Sohler +2 more
- 19 Jun 2016
TL;DR: It is proved that if a property can be tested with constant query complexity in the bidirectional model, then it can be testable with sublinear query complexityIn the unidirectional models, every property in hyperfinite digraphs is testableWith sublinear queries complexity.
26
References
Property testing and its connection to learning and approximation
TL;DR: This paper considers the question of determining whether a function f has property P or is ε-far from any function with property P, and devise algorithms to test whether the underlying graph has properties such as being bipartite, k-Colorable, or having a clique of density p-Clique with respect to the vertex set.
Robust Characterizations of Polynomials withApplications to Program Testing
Ronitt Rubinfeld,Madhu Sudan +1 more
TL;DR: The characterizations provide results in the area of coding theory by giving extremely fast and efficient error-detecting schemes for some well-known codes and play a crucial role in subsequent results on the hardness of approximating some NP-optimization problems.
1.1K
•Journal Article
Property Testing and its connection to Learning and Approximation
TL;DR: In this paper, the authors consider the question of determining whether a function f has property P or is e-far from any function with property P. In some cases, it is also allowed to query f on instances of its choice.
873
Efficient Testing of Large Graphs
TL;DR: In this paper, it was shown that first order graph properties not containing a quantifier alternation of type ''potion '' are always testable, while some properties containing this alternation are not.
385
Related Papers (5)
Oded Goldreich,Dana Ron +1 more
Dana Moshkovitz,Ran Raz +1 more
- 21 May 2006
Anna C. Gilbert,Brett Hemenway,Atri Rudra,Martin J. Strauss,Mary Wootters +4 more
- 12 Apr 2012