On the complexity landscape of connected \(f\)-factor problems (Q2414869)
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 7056540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity landscape of connected \(f\)-factor problems |
scientific article; zbMATH DE number 7056540 |
Statements
On the complexity landscape of connected \(f\)-factor problems (English)
0 references
17 May 2019
0 references
connected \(f\)-factors
0 references
quasi-polynomial time algorithms
0 references
randomized algorithms
0 references
NP-intermediate
0 references
exponential time hypothesis
0 references
0 references
0.9999999
0 references
0.9106165
0 references
0.89081347
0 references
0.88558865
0 references
0.8814318
0 references
0.87732077
0 references
0.8714215
0 references
0.86881703
0 references
0.86881703
0 references
0.86814713
0 references
