Prove unconditional lower bounds such as n^{\Omega(k)} for resolution or another restricted proof class certifying that an n-vertex graph has no k-clique.
Statement
Prove unconditional lower bounds such as n^{\Omega(k)} for resolution or another restricted proof class certifying that an n-vertex graph has no k-clique.
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.