Testing and learning convex sets in the ternary hypercube
From MaRDI portal
Cites work
- A polynomial lower bound for testing monotonicity
- Analysis of Boolean Functions
- Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness
- Combinatorial Structure of the Faces of then-Cube
- Constant depth circuits, Fourier transform, and learnability
- Downsampling for testing and learning in product distributions
- Edge-isoperimetric inequalities in the grid
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 1975229 (Why is no real title available?)
- scientific article; zbMATH DE number 3092909 (Why is no real title available?)
- scientific article; zbMATH DE number 7758320 (Why is no real title available?)
- Property testing and its connection to learning and approximation
- Sample-based high-dimensional convexity testing
- Testing convexity of figures under the uniform distribution
- The average sensitivity of an intersection of half spaces
- The power and limitations of uniform samples in testing properties of figures
- The reverse isoperimetric problem for Gaussian measure
- Tolerant Testers of Image Properties
- VC dimension and distribution-free sample-based testing
This page was built for publication: Testing and learning convex sets in the ternary hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906425)
