Pages that link to "Item:Q4417002"

The following pages link to Three theorems regarding testing graph properties (Q4417002):

Displaying 47 items.

• Densities in large permutations and parameter testing (Q338581) (← links)
• Two new perspectives on multi-stage group testing (Q378258) (← links)
• Hierarchy theorems for property testing (Q430844) (← links)
• Deterministic vs non-deterministic graph property testing (Q480810) (← links)
• Testing permutation properties through subpermutations (Q551179) (← links)
• On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
• Distributed discovery of large near-cliques (Q661050) (← links)
• \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
• Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
• A separation theorem in property testing (Q949795) (← links)
• An adaptivity hierarchy theorem for property testing (Q1630385) (← 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)
• Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
• Two-sided error proximity oblivious testing (Q2795747) (← links)
• Finding cycles and trees in sublinear time (Q2925521) (← links)
• A Canonical Form for Testing Boolean Function Properties (Q3088118) (← links)
• Inflatable Graph Properties and Natural Property Tests (Q3088125) (← links)
• On the Average-Case Complexity of Property Testing (Q3088183) (← links)
• Introduction to Testing Graph Properties (Q3088198) (← links)
• Contemplations on Testing Graph Properties (Q3088201) (← links)
• Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
• Fast Property Testing and Metrics for Permutations (Q3177362) (← links)
• Indistinguishability and First-Order Logic (Q3502636) (← links)
• Introduction to Testing Graph Properties (Q4933365) (← links)
• Hierarchy Theorems for Property Testing (Q4933380) (← links)
• Algorithmic Aspects of Property Testing in the Dense Graphs Model (Q4933381) (← links)
• A unified framework for testing linear‐invariant properties (Q4982614) (← links)
• On the Query Complexity of Estimating the Distance to Hereditary Graph Properties (Q4992842) (← links)
• Estimating parameters associated with monotone properties (Q4993108) (← links)
• (Q5009551) (← links)
• On the Effect of the Proximity Parameter on Property Testers (Q5098769) (← links)
• Flexible Models for Testing Graph Properties (Q5098784) (← links)
• Earthmover Resilience and Testing in Ordered Structures (Q5121906) (← links)
• A characterization of constant‐sample testable properties (Q5236924) (← links)
• Easily Testable Graph Properties (Q5364250) (← links)
• (Q5743465) (← 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)
• Fast distributed algorithms for testing graph properties (Q5915702) (← links)
• Testing subgraphs in directed graphs (Q5917574) (← links)
• Testing linear inequalities of subgraph statistics (Q6049999) (← links)
• Hypergraph regularity and random sampling (Q6076218) (← links)
• (Q6084359) (← links)
• A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)