Property testing of LP-type problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1670655 (Why is no real title available?)
- scientific article; zbMATH DE number 1775414 (Why is no real title available?)
- scientific article; zbMATH DE number 1875421 (Why is no real title available?)
- A combinatorial bound for linear programming and related problems
- A simple sampling lemma: Analysis and applications in geometric optimization
- A subexponential bound for linear programming
- Abstract Combinatorial Programs and Efficient Property Testers
- Algorithmic and analysis techniques in property testing
- Approximate testing of visual properties
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Introduction to Property Testing
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Linear programming — Randomization and abstract frameworks
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Small-dimensional linear programming and convex hulls made easy
- Testing Properties of Sets of Points in Metric Spaces
- Testing Properties of Sparse Images
- Testing assignments to constraint satisfaction problems
- Testing convexity of figures under the uniform distribution
- The optimal sample complexity of PAC learning
- The power and limitations of uniform samples in testing properties of figures
- Violator Spaces: Structure and Algorithms
This page was built for publication: Property testing of LP-type problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842473)
