NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Hardness of Approximation via Gap Problems

Investigation of inapproximability results through gap reduction techniques and their relationships to computational complexity classes.