Pages that link to "Item:Q3165958"
From MaRDI portal
The following pages link to A new approach to the planted clique problem (Q3165958):
Displaying 11 items.
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- Nuclear norm minimization for the planted clique and biclique problems (Q717132) (← links)
- Sum-of-squares Lower Bounds for Planted Clique (Q2941492) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- Algorithm for relatively small planted clique with small edge probability (Q3175452) (← links)
- Parallel tempering for the planted clique problem (Q3303299) (← links)
- On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique (Q4554356) (← links)
- On the subgraph query problem (Q4993118) (← links)
- Learning discrete distributions from untrusted batches (Q4993316) (← links)
- Sum-of-squares certificates for maxima of random tensors on the sphere (Q5002634) (← links)
- The planted k-factor problem (Q5877084) (← links)