scientific article; zbMATH DE number 1559556
From MaRDI portal
Publication:4527008
Recommendations
Cited in
(54)- Functions that have read-once branching programs of quadratic size are not necessarily testable
- Spot-checkers
- Algebraic testing and weight distributions of codes.
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
- A lower bound for testing juntas
- Property testing on \(k\)-vertex-connectivity of graphs
- Property testing of planarity in the \textsf{CONGEST} model
- Local reconstructors and tolerant testers for connectivity and diameter
- On testable properties in bounded degree graphs
- Testing cluster structure of graphs
- Parameter testing in bounded degree graphs of subexponential growth
- Quantum property testing for bounded-degree graphs
- On testing expansion in bounded-degree graphs
- Property testing and its connection to learning and approximation
- Property testing for bounded degree databases
- Property Testing on k-Vertex-Connectivity of Graphs
- Testing outerplanarity of bounded degree graphs
- Distance Approximation in Bounded-Degree and General Sparse Graphs
- Very large graphs
- Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
- scientific article; zbMATH DE number 1241385 (Why is no real title available?)
- Testing the diameter of graphs
- Testing subgraphs in large graphs
- Testing Expansion in Bounded-Degree Graphs
- On constant time approximation of parameters of bounded degree graphs
- Algorithmic Aspects of Property Testing in the Dense Graphs Model
- scientific article; zbMATH DE number 1418268 (Why is no real title available?)
- Testing outerplanarity of bounded degree graphs
- Testable bounded degree graph properties are random order streamable
- Property testing of planarity in the \textsf{CONGEST} model
- Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
- Planar graphs: random walks and bipartiteness testing
- On sampling edges almost uniformly
- The diameter of randomly perturbed digraphs and some applications
- Every property of hyperfinite graphs is testable
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian
- Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs
- An expansion tester for bounded degree graphs
- An Expansion Tester for Bounded Degree Graphs
- Testing problems with sublearning sample complexity
- Property testing in bounded degree graphs
- Robustly self-ordered graphs: constructions and applications to property testing
- Testing Eulerianity and connectivity in directed sparse graphs
- Robustly self-ordered graphs: constructions and applications to property testing
- Testing higher-order clusterability on graphs
- Symmetries, graph properties, and quantum speedups
- (Quantum) complexity of testing signed graph clusterability
- Testing some first-order logic properties on sparse graphs
- Fast and perfect sampling of subgraphs and polymer systems
- \(\omega\)-regular languages are testable with a constant number of queries
- Results on H-freeness testing in graphs of bounded r-admissibility
- Testing C_k-freeness in bounded admissibility graphs
- A separation theorem in property testing
- Every minor-closed property of sparse graphs is testable
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527008)
