There were some names there that I didn’t recognize and I don’t remember them participating.
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.
，推荐阅读17c 一起草官网获取更多信息
Global news & analysis
ВсеРоссияМирСобытияПроисшествияМнения