1 citations · 1 across the 2 of their papers we have counts for
4 papers
Computational thresholds for the fixed-magnetization Ising model
Charlie Carlson, Ewan Davies, Alexandra Kolla +1
The ferromagnetic Ising model is a model of a magnetic material and a central topic in statistical physics. It also plays a starring role in the algorithmic study of approximate co…
Lower bounds for Max-Cut in -free graphs via semidefinite programming
Charles Carlson, Alexandra Kolla, Ray Li +3
For a graph , let denote the size of the maximum cut in . The problem of estimating as a function of the number of vertices and edges of has a long history…
Improving the smoothed complexity of FLIP for max cut problems
Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
Finding locally optimal solutions for max-cut and max--cut are well-known PLS-complete problems. An instinctive approach to finding such a locally optimum solution is the FLIP m…
Optimal Lower Bounds for Sketching Graph Cuts
Charles Carlson, Alexandra Kolla, Nikhil Srivastava +1
We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undi…