Doubly-exponential computability of the minimum variable-degree function
Statement
Let denote the minimum variable-degree function for minimally unsatisfiable clause-sets indexed by deficiency, and let denote the functions represented by finite tuples . Computability conjecture. The function is complex, is not equal to for any finite tuple , and is nevertheless computable in doubly-exponential time. The paper presents this as a conjectural picture following its discussion of improved upper bounds.
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.