Tolerant versus intolerant testing for Boolean properties
From MaRDI portal
Recommendations
Cited in
(19)- Tolerant property testing and distance approximation
- Two-sided error proximity oblivious testing
- Partial tests, universal tests and decomposability
- Two-sided error proximity oblivious testing (extended abstract)
- Tolerant Linearity Testing and Locally Testable Codes
- Erasure-Resilient Property Testing
- Brief announcement: Erasure-resilience versus tolerance to errors
- scientific article; zbMATH DE number 7559095 (Why is no real title available?)
- Erasures vs. errors in local decoding and property testing
- A Note on Tolerant Testing with One-Sided Error
- Earthmover Resilience and Testing in Ordered Structures
- Erasures versus errors in local decoding and property testing
- Approximating the distance to monotonicity of Boolean functions
- Robustly self-ordered graphs: constructions and applications to property testing
- Sample-based distance-approximation for subsequence-freeness
- Testing versus estimation of graph properties, revisited
- Tolerant testers for subgraph-freeness
- Let's try to be more tolerant: on tolerant property testing and distance approximation (invited talk)
- Testing whether a digraph contains H-free k-induced subgraphs
This page was built for publication: Tolerant versus intolerant testing for Boolean properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002771)
