If the partial order of a set has at most one minimal element, then to test whether it has a non-crossing Hasse diagram its time complexity __________

If the partial order of a set has at most one minimal element, then to test whether it has a non-crossing Hasse diagram its time complexity __________ Correct Answer NP-complete

If the partial order has at most one minimal element, or it has at most one maximal element, then to test whether a partial order with multiple sources and sinks can be drawn as a crossing-free Hasse diagram or not it’s time complexity is NP-complete.
Bissoy MCQ

Related Questions

On a P-V diagram of an ideal gas, suppose a reversible adiabatic line intersects a reversible isothermal line at point A. Then at a point A, the slope of the reversible adiabatic line $${\left( {\frac{{\partial {\text{P}}}}{{\partial {\text{V}}}}} \right)_{\text{S}}}$$  and the slope of the reversible isothermal line $${\left( {\frac{{\partial {\text{P}}}}{{\partial {\text{V}}}}} \right)_{\text{T}}}$$  are related as (where, $${\text{y}} = \frac{{{{\text{C}}_{\text{p}}}}}{{{{\text{C}}_{\text{v}}}}}$$  )