Some geometric lower bounds
From MaRDI portal
Publication:6487948
DOI10.1007/BFB0015410zbMATH Open1512.68108MaRDI QIDQ6487948FDOQ6487948
Author name not available (Why is that?), William Steiger
Publication date: 21 March 2023
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Least Median of Squares Regression
- Title not available (Why is that?)
- Algorithms and complexity for least median of squares regression
- Time- and Space-Efficient Algorithms for Least Median of Squares Regression
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing Least Median of Squares Regression Lines and Guided Topological Sweep
- An Optimal-Time Algorithm for Slope Selection
- Algorithms for ham-sandwich cuts
- Lower bounds for algebraic decision trees
- Title not available (Why is that?)
Cited In (7)
- Lower Bounds for Geometrical and Physical Problems
- Title not available (Why is that?)
- A Geometric Derivation of Forney's Upper Bound
- Lower and upper bounds for some generalized arcs
- Minorations d’unités fondamentales—applications
- Lower and upper bounds for the waists of different spaces
- A note on lower bounds (Corresp.)
This page was built for publication: Some geometric lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487948)