We don't know whether the exact boundary between solvable and unsolvable optimization problems can be mapped with full precision for every possible problem type.
open
Global / Unspecified, Global
Some optimization problems are proven solvable efficiently, others proven intractable, but a complete boundary map covering every conceivable variation remains incomplete. This unresolved question is central to computational complexity theory.
Citation ID: WS01307
Title: We don't know whether the exact boundary between solvable and unsolvable optimization problems can be mapped with full precision for every possible problem type.
URL: https://worldsolve.org/index.php?api=problem&id=1307