ASCEND
BY NTHRYS

NTHRYS › PhD Assistance › Theoretical Computer Science

Theoretical Computer Science

Field
▾
Category
▾

Theoretical Computer Science

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Approximation Algorithms for NP-Hard Problems

Develops polynomial-time algorithms that produce near-optimal solutions for computationally intractable optimization problems.

Approximation Ratio Barriers in Constraint Satisfaction
Hardness of Approximation Beyond NP
Quantum-Inspired Techniques for Classical Approximation
Distributed Approximation in Massively Parallel Models
Smoothed Complexity of Approximation Algorithms
Inapproximability Through the Lens of Unique Games
Subexponential Approximation Schemes for Graph Problems
Approximation Kernelization and Parameterized Hardness
Sum-of-Squares Hierarchies and Polynomial Gaps
Approximation Algorithms Under Data Uncertainty

All Theoretical Computer Science PhD categories