Pages that link to "Item:Q3158518"

The following pages link to Property testing and its connection to learning and approximation (Q3158518):

Displaying 50 items.

• Approximate consistency for transformations on words and trees (Q264563) (← links)
• Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
• On the efficiency of polynomial time approximation schemes (Q290268) (← links)
• A self-tester for linear functions over the integers with an elementary proof of correctness (Q315532) (← links)
• Densities in large permutations and parameter testing (Q338581) (← links)
• Testing list \(H\)-homomorphisms (Q347111) (← links)
• Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
• Approximate membership for regular languages modulo the edit distance (Q387000) (← links)
• Testability of minimum balanced multiway cut densities (Q423907) (← links)
• Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
• Hierarchy theorems for property testing (Q430844) (← links)
• Testable and untestable classes of first-order formulae (Q440006) (← links)
• On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (Q466374) (← links)
• On testing Hamiltonicity of graphs (Q468434) (← links)
• Testing \(k\)-edge-connectivity of digraphs (Q469635) (← links)
• Is submodularity testable? (Q472463) (← links)
• Deterministic vs non-deterministic graph property testing (Q480810) (← links)
• Testing outerplanarity of bounded degree graphs (Q494925) (← links)
• Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length (Q497372) (← links)
• Testing periodicity (Q534782) (← links)
• Testing convexity properties of tree colorings (Q547293) (← links)
• Testing juntas (Q598252) (← links)
• On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
• Testing properties of graphs and functions (Q607829) (← links)
• A new proof of the graph removal lemma (Q640795) (← links)
• Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
• A property tester for tree-likeness of quartet topologies (Q649111) (← links)
• Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
• Distributed discovery of large near-cliques (Q661050) (← links)
• The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
• Property testing lower bounds via communication complexity (Q693004) (← links)
• \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
• An analytic approach to stability (Q710597) (← links)
• Sublinear time algorithms in the theory of groups and semigroups. (Q716397) (← links)
• Arithmetic progressions, different regularity lemmas and removal lemmas (Q746166) (← links)
• Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
• Testing computability by width-two OBDDs (Q764366) (← links)
• Property testing of the Boolean and binary rank (Q825974) (← links)
• Lower bounds for testing Euclidean minimum spanning trees (Q846011) (← links)
• Separating sublinear time computations by approximate diameter (Q849140) (← links)
• Information theory in property testing and monotonicity testing in higher dimension (Q859828) (← links)
• Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
• Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
• Property-preserving data reconstruction (Q930593) (← 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)
• Every minor-closed property of sparse graphs is testable (Q962147) (← links)
• Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
• Attribute estimation and testing quasi-symmetry (Q976083) (← links)