Computing Heegaard genus is NP-hard

From MaRDI portal
Publication:4604369




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}.



Cites work







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)