Sum-of-squares lower bounds for densest \(k\)-subgraph (Q6499217)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sum-of-squares lower bounds for densest \(k\)-subgraph |
scientific article; zbMATH DE number 7844574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sum-of-squares lower bounds for densest \(k\)-subgraph |
scientific article; zbMATH DE number 7844574 |
Statements
Sum-of-squares lower bounds for densest \(k\)-subgraph (English)
0 references
8 May 2024
0 references
average-case complexity
0 references
densest \(k\)-subgraph
0 references
sum-of-squares lower bounds
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
