ASCEND
BY NTHRYS

NTHRYSPhD AssistanceDiscrete Mathematics

Discrete Mathematics

Field
Category

Discrete Mathematics

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Approximation Algorithms and Hardness of Approximation

Design of polynomial-time approximation algorithms for NP-hard problems and proof of hardness results using probabilistically checkable proofs.

All Discrete Mathematics PhD categories