NP-hardness of Circuit Distance for polygons
Circuit Distance conjecture. The Circuit Distance problem is NP-hard for polygons.
MathDB