The complexity of determining the minimum number of flips that transform one triangulation of a convex point set into another remained a tantalizing open question for many decades. We settle this question by proving that computing shortest flip sequences between triangulations of convex polygons, and therefore also computing the rotation distance of binary trees, is NP-hard.
Here is re-post of an internal post:
，详情可参考体育直播
Use git worktrees for risky work. Experiments happen in an isolated directory.
Российское посольство заявило о спекуляции молдавских СМИ20:43