Lower Bounds for Geometrical and Physical Problems
From MaRDI portal
Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)
Recommendations
- Some geometric lower bounds
- scientific article; zbMATH DE number 1066186
- scientific article; zbMATH DE number 3945384
- A geometric lower bound theorem
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
- Lower Bounds for Geometric Diameter Problems
- Lower bounds for arithmetic problems
- Fractal dimension and lower bounds for geometric problems
- scientific article; zbMATH DE number 7236474
- Lower bounds for polynomials using geometric programming
Cited in
(9)- Computational complexity of robot arm simulation problems
- On boundaries of highly visible spaces and applications
- Motion planning with pulley, rope, and baskets
- Computational complexity of motion planning of a robot through simple gadgets
- Movement Problems for 2-Dimensional Linkages
- Motion planning with pulley, rope, and baskets
- scientific article; zbMATH DE number 2002586 (Why is no real title available?)
- Minorations d’unités fondamentales—applications
- Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard
This page was built for publication: Lower Bounds for Geometrical and Physical Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5691291)
