摘要: The dimension of a partial order P is the minimum number linear orders whose intersection P. There are efficient algorithms to test if has 1 or 2. We prove that it NP-complete determine 3. As consequence, several other related dimension-type problems shown be NP-complete.
aip.org
sci-hub.se 参考文章(0)