New NP-hardness results for 3-coloring and 2-to-1 label cover (Q2943894)
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 6478870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New NP-hardness results for 3-coloring and 2-to-1 label cover |
scientific article; zbMATH DE number 6478870 |
Statements
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover (English)
0 references
7 September 2015
0 references
NP-hardness
0 references
constraint satisfaction problems
0 references
graph coloring
0 references
label cover
0 references
0 references
0.8472323417663574
0 references
0.8433219790458679
0 references
0.8415834307670593
0 references
0.8368358612060547
0 references
0.8263306021690369
0 references
