Abstract
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) |
---|---|
Pages (from-to) | 133-135 |
Number of pages | 3 |
Journal | Order |
Volume | 6 |
Issue number | 2 |
DOIs | |
State | Published - Jun 1 1989 |
Keywords
- AMS subject classification (1980): 06A10.
- N-free
- NP-complete
- Ordered set
- dimension
ASJC Scopus subject areas
- Algebra and Number Theory
- Geometry and Topology
- Computational Theory and Mathematics