Computing the dimension of N-free ordered sets is NP-complete

Henry Kierstead, S. G. Penrice

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

We show that the problem of deciding whether an N-free ordered set has dimension at most 3 is NP-complete.

Original languageEnglish (US)
Pages (from-to)133-135
Number of pages3
JournalOrder
Volume6
Issue number2
DOIs
StatePublished - 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

Fingerprint Dive into the research topics of 'Computing the dimension of N-free ordered sets is NP-complete'. Together they form a unique fingerprint.

  • Cite this