The following pages link to Charles Carlson (Q783039):
Displaying 8 items.
- Spectral aspects of symmetric matrix signings (Q783041) (← links)
- Lower bounds for max-cut via semidefinite programming (Q2081648) (← links)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- Improving the Smoothed Complexity of FLIP for Max Cut Problems (Q5032028) (← links)
- Spectral aspects of symmetric matrix signings (Q5092445) (← links)
- Improving the smoothed complexity of FLIP for max cut problems (Q5236239) (← links)
- Optimal Lower Bounds for Sketching Graph Cuts (Q5236348) (← links)
- Efficient algorithms for the Potts model on small-set expanders (Q6503931) (← links)
