ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let minnonmer⁡:N→N\operatorname{minnonmer}:\mathbb{N}\to\mathbb{N} denote the minimum variable-degree function for minimally unsatisfiable clause-sets indexed by deficiency, and let potprec⁡(a⃗)\operatorname{potprec}(\vec a) denote the functions represented by finite tuples a⃗\vec a. Computability conjecture. The function minnonmer⁡\operatorname{minnonmer} is complex, is not equal to potprec⁡(a⃗)\operatorname{potprec}(\vec a) for any finite tuple a⃗\vec a, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.