On the complexity of partial order properties
From MaRDI portal
Recommendations
Cited in
(16)- Sorting and Recognition Problems for Ordered Sets
- The Complexity of Order Type Isomorphism
- A characteristic condition for simple partial ordering relations
- On optimal approximations of arbitrary relations by partial orders
- The solution space of sorting with recurring comparison faults
- scientific article; zbMATH DE number 5242380 (Why is no real title available?)
- scientific article; zbMATH DE number 108280 (Why is no real title available?)
- The complexity of the partial order dimension problem: closing the gap
- scientific article; zbMATH DE number 1985659 (Why is no real title available?)
- scientific article; zbMATH DE number 3907780 (Why is no real title available?)
- On the complexity of interval orders and semiorders
- The solution space of sorting with recurring comparison faults
- scientific article; zbMATH DE number 3909755 (Why is no real title available?)
- On partial order characterizations of information structures
- The fine-grained complexity of multi-dimensional ordering properties
- Computing and Verifying Depth Orders
This page was built for publication: On the complexity of partial order properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1590180)