On the VC-dimension of half-spaces with respect to convex sets

A family S of convex sets in the plane defines a hypergraph H = (S, E) as follows. Every subfamily S' of S defines a hyperedge of H if and only if there exists a halfspace h that fully contains S' , and no other set of S is fully contained in h. In this case, we say that h realizes S'. We say a set...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow, Shakhar Smorodinsky
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	Discrete Mathematics & Theoretical Computer Science 2021-08-01
סדרה:	Discrete Mathematics & Theoretical Computer Science
נושאים:	computer science - computational geometry computer science - discrete mathematics computer science - data structures and algorithms mathematics - combinatorics
גישה מקוונת:	https://dmtcs.episciences.org/6631/pdf
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!