We show that the problem of deciding whether an N-free ordered set has dimension at most 3 is NP-complete.
|Original language||English (US)|
|Number of pages||3|
|State||Published - Jun 1 1989|
- AMS subject classification (1980): 06A10.
- Ordered set
ASJC Scopus subject areas
- Algebra and Number Theory
- Geometry and Topology
- Computational Theory and Mathematics