The following pages link to (Q4525259):
Displaying 6 items.
- On building the transitive reduction of a two-dimensional poset (Q287116) (← links)
- Computing a poset from its realizer (Q287260) (← links)
- The computational complexity of rationalizing Pareto optimal choice behavior (Q483106) (← links)
- The complexity of embedding orders into small products of chains (Q603886) (← links)
- The Complexity of the Partial Order Dimension Problem: Closing the Gap (Q2957691) (← links)
- The Hardness of Approximating Poset Dimension (Q3503501) (← links)
