{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:40:54Z","timestamp":1787323254369,"version":"build-2736575974"},"reference-count":25,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["ESF EuroGIGA projects Compose and GraDR"],"award-info":[{"award-number":["ESF EuroGIGA projects Compose and GraDR"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Berlin Mathematical School"],"award-info":[{"award-number":["Berlin Mathematical School"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["FE-340\/7-2"],"award-info":[{"award-number":["FE-340\/7-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009532","name":"Ministerstvo Vnitra Cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["GACR GA14-10799S"],"award-info":[{"award-number":["GACR GA14-10799S"]}],"id":[{"id":"10.13039\/100009532","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2017,1]]},"abstract":"<jats:p>The dimension of a partial order $P$ is the minimum number of linear orders whose intersection is $P$. There are efficient algorithms to test if a partial order has dimension at most 2. In 1982 Yannakakis [SIAM J. Algebraic Discrete Methods, 3 (1982), pp. 351--358] showed that for $k\\geq 3$ to test if a partial order has dimension $\\leq k$ is NP-complete. The height of a partial order $P$ is the maximum size of a chain in $P$. Yannakakis also showed that for $k\\geq 4$ to test if a partial order of height $2$ has dimension $\\leq k$ is NP-complete. The complexity of deciding whether an order of height 2 has dimension 3 was left open. This question became one of the best known open problems in dimension theory for partial orders. We show that the problem is NP-complete. Technically, we show that the decision problem (3DH2) for dimension is equivalent to deciding for the existence of bipartite triangle containment representations (BTCon). This problem then allows a reduction from a class of planar satisfiability problems (P-3-CON-3-SAT(4)) which is known to be NP-hard.<\/jats:p>","DOI":"10.1137\/15m1007720","type":"journal-article","created":{"date-parts":[[2017,1,26]],"date-time":"2017-01-26T10:57:44Z","timestamp":1485428264000},"page":"172-189","source":"Crossref","is-referenced-by-count":6,"title":["The Complexity of the Partial Order Dimension Problem: Closing the Gap"],"prefix":"10.1137","volume":"31","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Irina","family":"Musta\u0163\u0103","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Pergel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"atypb1","first-page":"135","author":"Adiga A.","year":"2012","journal-title":"New York"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00814406"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1137\/0406018"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"P. Chalermsook, B. Laekhanukit, and D. Nanongkai,\n                      Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more\n                      , in proceedings of SODA, 2013, pp. 1557-1576.","DOI":"10.1137\/1.9781611973105.112"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.2307\/2371374"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1145\/321707.321710"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1023\/B:ORDE.0000009251.68514.8b"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1007\/s11083-010-9181-1"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00109-V"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9027-9"},{"key":"atypb11","unstructured":"M. R. Garey and D. S. Johnson,\n                      Computers and Intractability: A Guide to the Theory of NP-Completeness\n                      , W. H. Freeman, San Francisco, 1979."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2007.07.084"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02034331"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90143-0"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1071"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1137\/0211025"},{"key":"atypb17","unstructured":"R. M. McConnell and J. Spinrad,\n                      Linear-time transitive orientation\n                      , in proceedings of SODA, 1997, pp. 19-25."},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.4171\/dm\/117"},{"key":"atypb19","unstructured":"I. Mustat\u0327a\u0306 and M. Pergel,\n                      Unit Grid Intersection Graphs: Recognition and Properties\n                      , CoRR abs\/1306.1855, 2013."},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00353652"},{"key":"atypb21","first-page":"33","author":"Spinrad J.","year":"1994","journal-title":"New York"},{"key":"atypb22","first-page":"457","author":"Trotter W. T.","year":"1991","journal-title":"Bolyai Society"},{"key":"atypb23","unstructured":"W. T. Trotter,\n                      Combinatorics and Partially Ordered Sets: Dimension Theory\n                      , Johns Hopkins Ser. Math. Sci., Johns Hopkins University Press, Baltimore, 1992."},{"key":"atypb24","first-page":"253","volume":"116","author":"Trotter W. T.","year":"1996","journal-title":"Congr. Numer"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1137\/0603036"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/15M1007720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:51:08Z","timestamp":1787320268000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/15M1007720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1137\/15M1007720"],"URL":"https:\/\/doi.org\/10.1137\/15m1007720","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}