Problem Reductions at Scale: Agentic Integration of Computationally Hard Problems

概要

arXiv:2604.11535v2 Announce Type: replace 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 between hard problems would let practitioners r…