NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Fine-Grained Complexity of Geometric Algorithms

Establishes conditional lower bounds for geometric problems including range searching, proximity queries, and geometric optimization.