For a large class of random graph models, can semidefinite programs be approximately solved by local algorithms, with comparable performance for problems such as minimum…
Statement
For a large class of random graph models, can semidefinite programs be approximately solved by local algorithms, with comparable performance for problems such as minimum bisection and community detection?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.