NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Algorithm Design Complexity

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Fine-Grained Complexity Lower Bounds

Establishment of conditional lower bounds based on hardness assumptions like the Strong Exponential Time Hypothesis to characterize algorithm optimality.

Conditional Hardness in Polynomial-Time Computation

Fine-Grained Barriers to Matrix Multiplication Speed

Threshold Phenomena in Constraint Satisfaction Complexity

Algorithmic Phase Transitions and Hardness Cliffs

Subquadratic Lower Bounds Beyond CNF-SAT

Hardness of Approximation Under Fine-Grained Assumptions

Topology-Aware Lower Bounds in Graph Algorithms

Nondeterminism as a Barrier to Fine-Grained Speedups

Orthogonal Vector and Substring Matching Hardness

Entropy Barriers in Dynamic and Streaming Computation

All Algorithm Design & Complexity PhD categories