Computing Heegaard genus is NP-hard (Q4604369)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6843440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Heegaard genus is NP-hard |
scientific article; zbMATH DE number 6843440 |
Statements
Computing Heegaard Genus is NP-Hard (English)
0 references
26 February 2018
0 references
3-manifolds
0 references
Heegaard genus
0 references
computational complexity
0 references
NP-hard
0 references
satisfiability
0 references
0 references
0 references
0 references
0 references
0.8224826455116272
0 references
0.8119158148765564
0 references
0.7977657318115234
0 references
0.7962163686752319
0 references
0.7940955758094788
0 references
