Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q126345508, #quickstatements; #temporary_batch_1718130780407 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126345508 / rank | |||
Normal rank | |||
Revision as of 19:37, 11 June 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
