On the complexity of immersed normal surfaces
From MaRDI portal
Publication:280918
DOI10.2140/gt.2016.20.1061zbMath1339.68258arXiv1412.4988OpenAlexW2170715356MaRDI QIDQ280918
Arnaud de Mesmay, Éric Colin de Verdière, Benjamin A. Burton
Publication date: 10 May 2016
Published in: Geometry \& Topology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.4988
computational complexitypolynomial-time algorithmnormal surfaceBoolean constraint satisfactioncomputational 3-manifold theorylow-dimensional topology
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Some conditionally hard problems on links and 3-manifolds ⋮ Algorithms for contractibility of compressed curves on 3-manifold boundaries ⋮ Computing Heegaard Genus is NP-Hard
This page was built for publication: On the complexity of immersed normal surfaces
