Pages that link to "Item:Q3549321"

The following pages link to A Characterization of the (Natural) Graph Properties Testable with One-Sided Error (Q3549321):

Displaying 50 items.

• Testable and untestable classes of first-order formulae (Q440006) (← links)
• Testing permutation properties through subpermutations (Q551179) (← links)
• Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
• A separation theorem in property testing (Q949795) (← links)
• Every minor-closed property of sparse graphs is testable (Q962147) (← links)
• Estimating the distance to a hereditary graph property (Q1689980) (← links)
• Forbidding induced even cycles in a graph: typical structure and counting (Q1748271) (← links)
• Testing graphs against an unknown distribution (Q2130521) (← links)
• A characterization of easily testable induced digraphs and \(k\)-colored graphs (Q2136197) (← links)
• Induced arithmetic removal: complexity 1 patterns over finite fields (Q2142699) (← links)
• Efficient removal lemmas for matrices (Q2183099) (← links)
• On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
• Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
• Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
• Additive approximation for edge-deletion problems (Q2389218) (← links)
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
• Perfect Graphs of Fixed Density: Counting and Homogeneous Sets (Q2911067) (← links)
• A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
• Parameter testing in bounded degree graphs of subexponential growth (Q3055893) (← links)
• Inflatable Graph Properties and Natural Property Tests (Q3088125) (← 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)
• Testing Expansion in Bounded-Degree Graphs (Q4911108) (← links)
• Sublinear-time Algorithms (Q4933363) (← links)
• Sublinear Graph Approximation Algorithms (Q4933367) (← links)
• Local Property Reconstruction and Monotonicity (Q4933387) (← 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)
• Efficient Testing without Efficient Regularity (Q4993324) (← links)
• Efficient Removal Lemmas for Matrices (Q5002628) (← links)
• (Q5002650) (← links)
• (Q5009551) (← links)
• Polynomial removal lemmas for ordered graphs (Q5051460) (← links)
• Testing Linear-Invariant Properties (Q5096106) (← links)
• On the Effect of the Proximity Parameter on Property Testers (Q5098769) (← links)
• Earthmover Resilience and Testing in Ordered Structures (Q5121906) (← links)
• An Algebraic Characterization of Testable Boolean CSPs (Q5326555) (← links)
• Minimum Number of Monotone Subsequences of Length 4 in Permutations (Q5364246) (← links)
• Easily Testable Graph Properties (Q5364250) (← links)
• Non-Deterministic Graph Property Testing (Q5397730) (← links)
• (Q5743465) (← links)
• Fast distributed algorithms for testing graph properties (Q5915702) (← links)
• A note on permutation regularity (Q5916098) (← links)
• Quasi-random words and limits of word sequences (Q5918087) (← links)
• On 3‐graphs with no four vertices spanning exactly two edges (Q6051388) (← links)
• Hypergraph regularity and random sampling (Q6076218) (← links)
• (Q6084359) (← links)
• Local-vs-global combinatorics (Q6198642) (← links)