Select a category to explore research frontiers
Loading categories...
This research focuses on designing algorithms with subexponential running times for NP-hard problems through advanced techniques like fast exponential algorithms, meet-in-the-middle approaches, and algebraic methods.