Computational Complexity
It is possible to determine in polynomial time whether a given finite partially ordered set has order dimension at most two, for instance, by testing whether the comparability graph of the partial order is a permutation graph. However, for any k ≥ 3, it is NP-complete to test whether the order dimension is at most k (Yannakakis 1982).
Read more about this topic: Order Dimension
Famous quotes containing the word complexity:
“The price we pay for the complexity of life is too high. When you think of all the effort you have to put in—telephonic, technological and relational—to alter even the slightest bit of behaviour in this strange world we call social life, you are left pining for the straightforwardness of primitive peoples and their physical work.”
—Jean Baudrillard (b. 1929)