Pages that link to "Item:Q3122310"
From MaRDI portal
The following pages link to On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310):
Displaying 7 items.
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- A note concerning the closest point pair algorithm. (Q1853012) (← links)
- Two-dimensional closest pair problem: a closer look (Q2004080) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- (Q5092465) (← links)
- On the hardness of approximate and exact (bichromatic) maximum inner product (Q5140838) (← links)
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735) (← links)