Pages that link to "Item:Q5189542"
From MaRDI portal
The following pages link to A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity (Q5189542):
Displaying 31 items.
- Densities in large permutations and parameter testing (Q338581) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- Deterministic vs non-deterministic graph property testing (Q480810) (← links)
- Testing permutation properties through subpermutations (Q551179) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- The Bradley-Terry condition is \(L_1\)-testable (Q1699573) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- 2-transitivity is insufficient for local testability (Q1947041) (← 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)
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
- Sunflowers and testing triangle-freeness of functions (Q2410684) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Inflatable Graph Properties and Natural Property Tests (Q3088125) (← links)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q3387757) (← links)
- A unified framework for testing linear‐invariant properties (Q4982614) (← links)
- Efficient Testing without Efficient Regularity (Q4993324) (← links)
- Sublinear Algorithms for MAXCUT and Correlation Clustering (Q5002682) (← links)
- (Q5009551) (← links)
- Seeding with Costly Network Information (Q5106371) (← links)
- Earthmover Resilience and Testing in Ordered Structures (Q5121906) (← links)
- A characterization of constant‐sample testable properties (Q5236924) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- A unified view of graph regularity via matrix decompositions (Q6074704) (← links)
- Hypergraph regularity and random sampling (Q6076218) (← links)
- (Q6084359) (← links)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q6139828) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)