For a random MAX R-3SAT formula F with m random 3-literal clauses on n variables, can an efficiently computable quantity A(F) approximate the expected optimum number of…
Statement
For a random MAX R-3SAT formula F with m random 3-literal clauses on n variables, can an efficiently computable quantity A(F) approximate the expected optimum number of satisfiable clauses?
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.