Pages that link to "Item:Q3624375"
From MaRDI portal
The following pages link to Every Monotone Graph Property Is Testable (Q3624375):
Displayed 16 items.
- Densities in large permutations and parameter testing (Q338581) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- Testing permutation properties through subpermutations (Q551179) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- The Bradley-Terry condition is \(L_1\)-testable (Q1699573) (← links)
- Testing graphs against an unknown distribution (Q2130521) (← links)
- Hierarchy theorems for testing properties in size-oblivious query complexity (Q2281254) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Additive stabilizers for unstable graphs (Q2419360) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Hierarchy Theorems for Property Testing (Q4933380) (← links)
- On the Query Complexity of Estimating the Distance to Hereditary Graph Properties (Q4992842) (← links)
- Estimating parameters associated with monotone properties (Q4993108) (← links)
- Hypergraph regularity and random sampling (Q6076218) (← links)
- Steady and ranging sets in graph persistence (Q6102901) (← links)