Prove lower bounds on the size of Cutting Planes refutations for random k-CNF formulas; this is a long-standing open problem with recent progress.
Statement
Prove lower bounds on the size of Cutting Planes refutations for random k-CNF formulas; this is a long-standing open problem with recent progress.
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.