--- res: bibo_abstract: - We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Benjamin foaf_name: Burton, Benjamin foaf_surname: Burton - foaf_Person: foaf_givenName: Arnaud N foaf_name: De Mesmay, Arnaud N foaf_surname: De Mesmay foaf_workInfoHomepage: http://www.librecat.org/personId=3DB2F25C-F248-11E8-B48F-1D18A9856A87 - foaf_Person: foaf_givenName: Uli foaf_name: Wagner, Uli foaf_surname: Wagner foaf_workInfoHomepage: http://www.librecat.org/personId=36690CA2-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-1494-0568 bibo_doi: 10.4230/LIPIcs.SoCG.2016.24 bibo_volume: 51 dct_date: 2016^xs_gYear dct_language: eng dct_publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing@ dct_title: Finding non-orientable surfaces in 3-manifolds@ ...