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

Henry Kierstead, S. G. Penrice

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Fingerprint

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

Mathematics