Pages that link to "Item:Q2931390"
From MaRDI portal
The following pages link to A combinatorial characterization of the testable graph properties (Q2931390):
Displaying 36 items.
- Hierarchy theorems for property testing (Q430844) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Testing properties of graphs and functions (Q607829) (← links)
- Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
- A separation theorem in property testing (Q949795) (← links)
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing (Q952421) (← links)
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- Sparse affine-invariant linear codes are locally testable (Q2012176) (← links)
- Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
- Hierarchy theorems for testing properties in size-oblivious query complexity (Q2281254) (← links)
- Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- A Brief Introduction to Property Testing (Q3088197) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- Relational Properties Expressible with One Universal Quantifier Are Testable (Q3646124) (← links)
- A Brief Introduction to Property Testing (Q4933359) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Invariance in Property Testing (Q4933370) (← links)
- Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability (Q4933375) (← links)
- Hierarchy Theorems for Property Testing (Q4933380) (← links)
- Algorithmic Aspects of Property Testing in the Dense Graphs Model (Q4933381) (← links)
- On model selection for dense stochastic block models (Q5066878) (← links)
- Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
- An Algebraic Characterization of Testable Boolean CSPs (Q5326555) (← links)
- Testing Graph Blow-Up (Q5894224) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894226) (← links)
- Testing Graph Blow-Up (Q5894229) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894230) (← links)
- A note on permutation regularity (Q5916098) (← links)
