Pages that link to "Item:Q5946378"

The following pages link to An improved bound for \(k\)-sets in three dimensions (Q5946378):

Displaying 32 items.

• Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
• On levels in arrangements of surfaces in three dimensions (Q443917) (← links)
• Outlier respecting points approximation (Q517798) (← links)
• Generalized ham-sandwich cuts (Q603848) (← links)
• The \(k\)-centrum straight-line location problem (Q655169) (← links)
• The projection median of a set of points in \({\mathbb{R}}^{d}\) (Q664356) (← links)
• \(k\)-sets in four dimensions (Q818689) (← links)
• Finding large 3-free sets. I. The small \(n\) case (Q927879) (← links)
• Points surrounding the origin (Q1046738) (← links)
• Improved bounds for planar \(k\)-sets and related problems (Q1387847) (← links)
• An improved bound on the Minkowski dimension of Besicovitch sets in \(\mathbb{R}^3\) (Q1840449) (← links)
• On the number of corner cuts (Q1865258) (← links)
• The number of extreme triples of a planar point set (Q1921337) (← links)
• An improved upper bound for the \(3\)-dimensional dimer problem (Q1974841) (← links)
• On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
• The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem (Q2033908) (← links)
• Algebraic \(k\)-sets and generally neighborly embeddings (Q2117359) (← links)
• A single set improvement to the \(3k - 4\) theorem (Q2187135) (← links)
• Dense point sets with many halving lines (Q2207605) (← links)
• Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem (Q2373932) (← links)
• A multiple set version of the \(3k-3\) theorem (Q2567444) (← links)
• An Improved Bound for <i>k</i>-Sets in Four Dimensions (Q3068817) (← links)
• New results on lower bounds for the number of (⩽ k)-facets (Q3503472) (← links)
• Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
• THE EULER NUMBER OF DISCRETISED SETS – SURPRISING RESULTS IN THREE DIMENSIONS (Q4977606) (← links)
• (Q5088995) (← links)
• Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
• On approximate range counting and depth (Q5902137) (← links)
• Improved bounds for the expected number of \(k\)-sets (Q6050223) (← links)
• On the bichromatic \(k\)-set problem (Q6486951) (← links)
• Brillouin zones of integer lattices and their perturbations (Q6561320) (← links)
• Depth in arrangements: Dehn-Sommerville-Euler relations with applications (Q6645901) (← links)