NTHRYS › PhD Assistance › Algorithm Design Complexity
Select a category to explore research frontiers
Loading categories...
Studies conditional hardness of approximation and establishes tight running time bounds for approximation algorithms.
All Algorithm Design & Complexity PhD categories