Problem Reductions at Scale: Agentic Integration of Computationally Hard Problems
arXiv:2604.11535v1 Announce Type: new
Abstract: Solving an NP-hard optimization problem often requires reformulating it for a specific solver — quantum hardware, a commercial optimizer, or a domain heuristic. A tool for polynomial-time reductions bet…