Establish lower bounds analogous to the exponential Cutting Planes lower bound for random O(\log n)-CNF formulas in other proof systems.
Statement
Establish lower bounds analogous to the exponential Cutting Planes lower bound for random O(\log n)-CNF formulas in other proof systems.
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.