NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Polynomial Time Solvable Subclasses of Hard Problems

Identification and algorithm design for tractable subclasses of NP-hard problems with structural restrictions.