Algorithm Design Complexity

Research Frontiers in Approximation Hardness and Inapproximability

Study of hardness of approximation results including conditional lower bounds based on complexity assumptions like P versus NP.

All Algorithm Design & Complexity PhD categories