The following pages link to On Proximity-Oblivious Testing (Q3020015):
Displayed 20 items.
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- A non-extendibility certificate for submodularity and applications (Q2019511) (← links)
- Testing graphs against an unknown distribution (Q2130521) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- Two-sided error proximity oblivious testing (Q2795747) (← links)
- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← links)
- Parameterized property testing of functions (Q4638061) (← links)
- Efficient Testing without Efficient Regularity (Q4993324) (← links)
- (Q5009557) (← links)
- (Q5090383) (← links)
- Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
- (Q5090414) (← links)
- Testing Linear-Invariant Properties (Q5096106) (← links)
- On the Effect of the Proximity Parameter on Property Testers (Q5098769) (← links)
- (Q5140837) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- Testing linear inequalities of subgraph statistics (Q6049999) (← links)
- (Q6084359) (← links)