四、审议通过政协第十四届全国委员会第四次会议政治决议
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.，更多细节参见heLLoword翻译官方下载
。关于这个话题，体育直播提供了深入分析
Иран назвал путь к прекращению войны14:05。PDF资料对此有专业解读
В Иране заявили о поражении американского эсминца02:21