Sample-based distance-approximation for subsequence-freeness

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Estimating the distance to a hereditary graph property
Tolerant property testing and distance approximation
Local Reconstructors and Tolerant Testers for Connectivity and Diameter
Approximating the distance to monotonicity in high dimensions
Property testing and its connection to learning and approximation
Sampling lower bounds via information theory
Tolerant Linearity Testing and Locally Testable Codes
Erasure-Resilient Property Testing
Robust Characterizations of Polynomials with Applications to Program Testing
Approximating the distance to properties in bounded-degree and general sparse graphs
Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism
L _p -testing
Testing versus Estimation of Graph Properties
Estimating the distance to a monotone function
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error
Tolerant Testers of Image Properties
Erasures versus errors in local decoding and property testing
Approximating the distance to monotonicity of Boolean functions
VC dimension and distribution-free sample-based testing
Downsampling for testing and learning in product distributions
Robustly self-ordered graphs: constructions and applications to property testing
Improved monotonicity testers via hypercube embeddings
Sample-based distance-approximation for subsequence-freeness

This page was built for publication: Sample-based distance-approximation for subsequence-freeness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586659)