Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536)
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 7179702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum fill-in: inapproximability and almost tight lower bounds |
scientific article; zbMATH DE number 7179702 |
Statements
Minimum fill-in: inapproximability and almost tight lower bounds (English)
0 references
12 March 2020
0 references
sparse matrix
0 references
inapproximability
0 references
subexponential-time algorithm
0 references
fine-grained complexity
0 references
0 references
0 references
0 references
0.9815509915351868
0 references
0.8347743153572083
0 references
0.8268789649009705
0 references
