Computing Heegaard Genus is NP-Hard

From MaRDI portal
Publication:4604369


DOI10.1007/978-3-319-44479-6_3zbMath1388.57020arXiv1606.01553MaRDI QIDQ4604369

Ryan Derby-Talbot, David Bachman, Eric Sedgwick

Publication date: 26 February 2018

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

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


68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)


Related Items



Cites Work