A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
From MaRDI portal
(Redirected from Publication:3549321)
Recommendations
Cited in
(54)- Testing Odd-Cycle-Freeness in Boolean Functions
- Perfect graphs of fixed density: counting and homogeneous sets
- Testing Linear-Invariant Properties
- An algebraic characterization of testable Boolean CSPs
- A unified framework for testing linear-invariant properties
- Hypergraph regularity and random sampling
- On 3‐graphs with no four vertices spanning exactly two edges
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Sublinear-time Algorithms
- Efficient testing without efficient regularity
- Testability and repair of hereditary hypergraph properties
- On the Effect of the Proximity Parameter on Property Testers
- Quasi-random words and limits of word sequences
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Contemplations on Testing Graph Properties
- Estimating parameters associated with monotone properties
- On the testability of graph partition properties
- Testing Eulerianity and connectivity in directed sparse graphs
- A characterization of easily testable induced digraphs and \(k\)-colored graphs
- Earthmover Resilience and Testing in Ordered Structures
- Testable and untestable classes of first-order formulae
- Induced arithmetic removal: complexity 1 patterns over finite fields
- Two-sided error proximity oblivious testing
- Testing odd-cycle-freeness in Boolean functions
- Local property reconstruction and monotonicity
- Additive approximation for edge-deletion problems
- Two-sided error proximity oblivious testing (extended abstract)
- Fast property testing and metrics for permutations
- A separation theorem in property testing
- Ordered graph limits and their applications
- Testing versus estimation of graph properties, revisited
- On the Query Complexity of Estimating the Distance to Hereditary Graph Properties
- Parameter testing in bounded degree graphs of subexponential growth
- Inflatable graph properties and natural property tests
- Local-vs-global combinatorics
- Testing permutation properties through subpermutations
- Testing Expansion in Bounded-Degree Graphs
- Efficient removal lemmas for matrices
- Polynomial removal lemmas for ordered graphs
- scientific article; zbMATH DE number 7758318 (Why is no real title available?)
- Sublinear graph approximation algorithms
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- A note on permutation regularity
- Estimating the distance to a hereditary graph property
- Efficient removal lemmas for matrices
- Testing hereditary properties of sequences
- A characterization of testable hypergraph properties
- Lower bounds for testing triangle-freeness in Boolean functions
- Easily testable graph properties
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
- Every minor-closed property of sparse graphs is testable
- Forbidding induced even cycles in a graph: typical structure and counting
- Non-deterministic graph property testing
- Degenerate Turán densities of sparse hypergraphs
This page was built for publication: A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549321)
