NTHRYS › PhD Assistance › Discrete Mathematics
Select a category to explore research frontiers
Loading categories...
Design of polynomial-time approximation algorithms for NP-hard problems and proof of hardness results using probabilistically checkable proofs.
All Discrete Mathematics PhD categories