NTHRYS › PhD Assistance › Theoretical Computer Science

Theoretical Computer Science

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Hardness of Approximation and PCP Theorem

Proves inapproximability results for optimization problems using probabilistically checkable proofs and gap problems.