computational hardness
A classification of the difficulty associated with solving certain problems within computational complexity theory, impacting algorithm design and indicating which problems may require impractically large amounts of resources.
- A Computationally Viable Numerical Gradient-based Technique for Optimal Covering Problems
- ALE-Bench: A Benchmark for Long-Horizon Objective-Driven Algorithm Engineering
- An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
- An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
- Improving Decision Trees through the Lens of Parameterized Local Search