Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ic.2020.104514 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IC.2020.104514 / rank | |||
Normal rank | |||
Latest revision as of 22:09, 17 December 2024
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
