Lower Bounds for Geometrical and Physical Problems

DOI10.1137/S0097539793243338zbMATH Open0864.68106MaRDI QIDQ5691291FDOQ5691291

Jürgen Sellen

Publication date: 28 January 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

motion planning

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Cited In (2)

• Minorations d’unités fondamentales—applications
• On boundaries of highly visible spaces and applications

Recommendations

• Lower bounds for polynomials using geometric programming 👍 👎
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS 👍 👎
• Lower bounds for arithmetic problems 👍 👎
• A geometric lower bound theorem 👍 👎
• Fractal dimension and lower bounds for geometric problems 👍 👎
• Some geometric lower bounds 👍 👎
• Lower Bounds for Geometric Diameter Problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)