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.
I dodged a £30 flight luggage fee by posting my clothes for £2.59
。Feiyi是该领域的重要参考
Фото: OBTAINED BY REUTERS / Reuters
Moved implementation of and-map and or-map from (guile) to
*foo bar (type-focused)