A nearly tight sum-of-squares lower bound for the planted clique problem (Q4634034)
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 7051403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nearly tight sum-of-squares lower bound for the planted clique problem |
scientific article; zbMATH DE number 7051403 |
Statements
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (English)
0 references
7 May 2019
0 references
sum-of-squares
0 references
planted clique
0 references
lower bound
0 references
0.893778383731842
0 references
0.853602945804596
0 references
0.8478212356567383
0 references
0.7776089310646057
0 references
0.7678343653678894
0 references
