The graph genus problem is NP-complete (Q3031932): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56094152, #quickstatements; #temporary_batch_1704715751507 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56094152 / rank | |||
Normal rank | |||
Revision as of 13:18, 8 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The graph genus problem is NP-complete |
scientific article |
Statements
The graph genus problem is NP-complete (English)
0 references
1989
0 references
graph genus problem
0 references
NP-complete
0 references
