Computing Heegaard genus is NP-hard

From MaRDI portal
Publication:4604369

DOI10.1007/978-3-319-44479-6_3zbMATH Open1388.57020arXiv1606.01553OpenAlexW2413157341MaRDI QIDQ4604369FDOQ4604369


Authors: David Bachman, Ryan Derby-Talbot, Eric Sedgwick Edit this on Wikidata


Publication date: 26 February 2018

Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)

Abstract: We show that {sc Heegaard Genus leqg}, the problem of deciding whether a triangulated 3-manifold admits a Heegaard splitting of genus less than or equal to g, is NP-hard. The result follows from a quadratic time reduction of the NP-complete problem {sc CNF-SAT} to {sc Heegaard Genus leqg}.


Full work available at URL: https://arxiv.org/abs/1606.01553




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Computing Heegaard genus is NP-hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604369)