A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams

Documenti analoghi

• Inapproximability of Maximum Diameter Clustering for Few Clusters
  di: Fleischmann, Henry, et al.
  Pubblicazione: (2023)
• Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
  di: Khanna, Sanjeev, et al.
  Pubblicazione: (2025)
• Lower Bounds for Convexity Testing
  di: Chen, Xi, et al.
  Pubblicazione: (2024)
• Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
  di: Cohen-Addad, Vincent, et al.
  Pubblicazione: (2026)
• Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
  di: Bringmann, Karl, et al.
  Pubblicazione: (2024)