Topological complexity of the range searching

DOI10.1006/jcom.1999.0527zbMath0951.68024OpenAlexW2068873984MaRDI QIDQ1977139

Dima Yu. Grigoriev

Publication date: 9 May 2000

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1999.0527

zbMATH Keywords

searching problemtopological decision tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Efficient evaluation of specific queries in constraint databases ⋮ Finding a vector orthogonal to roughly half a collection of vectors ⋮ Evaluating geometric queries using few arithmetic operations ⋮ VPSPACE and a transfer theorem over the complex field

Cites Work

• Unnamed Item
• Point location in arrangements of hyperplanes
• On the topology of algorithms. I
• Complexity of deciding Tarski algebra
• On the combinatorial and algebraic complexity of quantifier elimination

This page was built for publication: Topological complexity of the range searching