Sampling in combinatorial and geometric set systems
Learning and adaptive systems in artificial intelligence (68T05) Sampling theory, sample surveys (62D05) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Irregularities of distribution, discrepancy (11K38) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) 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 convex and discrete geometry (52-01)
- Optimal approximations made easy
- Hitting sets when the shallow cell complexity is small
- scientific article; zbMATH DE number 109322 (Why is no real title available?)
- Optimal volume-sensitive bounds for polytope approximation
- The geodesic edge center of a simple polygon
- MORPHOLOGICAL SAMPLING OF CLOSED SETS
- An optimal sparsification lemma for low-crossing matchings and its applications to discrepancy and approximations
- Dimension-independent kernel -covers
- Geometrical quantity on random checkerboards on the regular torus
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)
