Pages that link to "Item:Q5360350"

The following pages link to Polynomial partitioning for a set of varieties (Q5360350):

Displaying 20 items.

• A crossing lemma for Jordan curves (Q1647400) (← links)
• Polynomial partitioning for several sets of varieties (Q1687152) (← links)
• Almost tight bounds for eliminating depth cycles in three dimensions (Q1745206) (← links)
• Incidences between points and curves with almost two degrees of freedom (Q2077267) (← links)
• Joints of varieties (Q2127884) (← links)
• Eliminating depth cycles among triangles in three dimensions (Q2207590) (← links)
• The polynomial method over varieties (Q2208425) (← links)
• Removing depth-order cycles among triangles: an algorithm generating triangular fragments (Q2225657) (← links)
• Cutting algebraic curves into pseudo-segments and applications (Q2397099) (← links)
• Curves in \(\mathbb {R}^4\) and two-rich points (Q2408193) (← links)
• Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (Q4989918) (← links)
• Distinct distances in the complex plane (Q5009321) (← links)
• Sphere tangencies, line incidences and Lie’s line-sphere correspondence (Q5063193) (← links)
• Counting and Cutting Rich Lenses in Arrangements of Circles (Q5071100) (← links)
• (Q5088930) (← links)
• On Ray Shooting for Triangles in 3-Space and Related Problems (Q5092511) (← links)
• Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications (Q5138781) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• Borsuk-Ulam theorems for elementary abelian 2-groups (Q6044503) (← links)
• (Q6131060) (← links)