由三元组序信息重构度量树是NP完备的
Reconstructing Metric Trees from Order Information on Triples is NP Complete
摘要：
我们证明了从三元组的顺序信息重建一棵树是NP难的。这与超度量和四元组上的子树信息的情况相反，这两者都已知允许多项式时间重构。
英文摘要：
We show that reconstructing a tree from order information on triples is NP-hard. This is in contrast to the case for ultra-metrics and for subtree information on quadruples which are both known to allow polynomial time reconstruction.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
