Sampling in combinatorial and geometric set systems
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Irregularities of distribution, discrepancy (11K38) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to convex and discrete geometry (52-01) Combinatorial complexity of geometric structures (52C45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Sampling theory, sample surveys (62D05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Learning and adaptive systems in artificial intelligence (68T05)
- Optimal approximations made easy
- scientific article; zbMATH DE number 109322 (Why is no real title available?)
- MORPHOLOGICAL SAMPLING OF CLOSED SETS
- Hitting sets when the shallow cell complexity is small
- An optimal sparsification lemma for low-crossing matchings and its applications to discrepancy and approximations
- The geodesic edge center of a simple polygon
- Optimal volume-sensitive bounds for polytope approximation
- Dimension-independent kernel -covers
- Geometrical quantity on random checkerboards on the regular torus
- Approximate sunflowers with convex sets
- Optimal area-sensitive bounds for polytope approximation
This page was built for publication: Sampling in combinatorial and geometric set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033061)
