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 and PCP Theorem

Establishment of hardness of approximation results using the Probabilistically Checkable Proofs theorem and reductions.