Pages that link to "Item:Q917017"
From MaRDI portal
The following pages link to Combinatorial complexity bounds for arrangements of curves and spheres (Q917017):
Displaying 16 items.
- Counting and Cutting Rich Lenses in Arrangements of Circles (Q5071100) (← links)
- Non-Degenerate Spheres in Three Dimensions (Q5199504) (← links)
- Breaking the 3/2 Barrier for Unit Distances in Three Dimensions (Q5206099) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS (Q5316931) (← links)
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES (Q5484909) (← links)
- From harmonic analysis to arithmetic combinatorics (Q5503659) (← links)
- On lazy randomized incremental construction (Q5917712) (← links)
- Radial points in the plane (Q5946643) (← links)
- On the complexity of arrangements of circles in the plane (Q5955140) (← links)
- Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions (Q5964223) (← links)
- Improved Elekes-Szabó type estimates using proximity (Q6071957) (← links)
- Concentration estimates for algebraic intersections (Q6101972) (← links)
- Classification of maps sending lines into translates of a curve (Q6102094) (← links)
- Extremal problems for geometric hypergraphs (Q6487430) (← links)
- Interview with Micha Sharir (Q6659997) (← links)