scientific article
From MaRDI portal
Publication:3113727
DOI10.4230/LIPIcs.STACS.2011.649zbMath1230.68111MaRDI QIDQ3113727
Hans Raj Tiwary, Daniel Werner, Christian Knauer
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_f888.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatorial complexity of geometric structures (52C45)
Related Items (5)
Unnamed Item ⋮ Helly’s theorem: New variations and applications ⋮ Approximating Tverberg points in linear time for any fixed dimension ⋮ Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
This page was built for publication:
