Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum fill-in: inapproximability and almost tight lower bounds |
scientific article |
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 references
