A characterization of constant‐sample testable properties
From MaRDI portal
Publication:5236924
DOI10.1002/rsa.20807zbMath1422.68271arXiv1612.06016OpenAlexW2577805882MaRDI QIDQ5236924
Publication date: 16 October 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.06016
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The final form of Tao's inequality relating conditional expectation and conditional mutual information
- Property testing. Current research and surveys
- Partial tests, universal tests and decomposability
- On Sample-Based Testers
- Property testing and its connection to learning and approximation
- Monotonicity testing over general poset domains
- Three theorems regarding testing graph properties
- Robust Characterizations of Polynomials with Applications to Program Testing
- Invariance in Property Testing
- A unified framework for testing linear‐invariant properties
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- Partially Symmetric Functions Are Efficiently Isomorphism Testable
- A characterization of locally testable affine-invariant properties via decomposition theorems
- An Algebraic Characterization of Testable Boolean CSPs
- On Active and Passive Testing
- Testing problems with sublearning sample complexity
- Testing monotonicity
