Probing a set of hyperplanes by lines and related problems

DOI10.1007/3-540-57155-8_237zbMath1504.68245OpenAlexW1590151786MaRDI QIDQ5060099

Keiko Imai, David Rappaport, Yasukazu Aoki, Hiroshi Imai

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_237

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Solving systems of algebraic equations by a general elimination method
• Résolution des systèmes d'équations algébriques
• The complexity of partial derivatives
• Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality—
• Shape from probing
• On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials

This page was built for publication: Probing a set of hyperplanes by lines and related problems