Pages that link to "Item:Q5259536"

The following pages link to Rounding sum-of-squares relaxations (Q5259536):

Displaying 14 items.

• Finding a low-rank basis in a matrix subspace (Q517309) (← links)
• Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
• Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
• Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
• Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling (Q1746610) (← links)
• Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
• Quantum de Finetti theorems under local measurements with applications (Q2358805) (← links)
• Sum-of-Squares Rank Upper Bounds for Matching Problems (Q2835696) (← links)
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
• (Q5002634) (← links)
• (Q5054600) (← links)
• Disordered systems insights on computational hardness (Q5055432) (← links)
• (Q5090440) (← links)
• Iterated linear optimization (Q5157412) (← links)