В Израиле одним словом оценили ход операции против Ирана14:58
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.
，推荐阅读PDF资料获取更多信息
법원, 장동혁 지도부의 배현진 징계 효력정지
Full spec in cTP.md