Apr 5, 2019 · Abstract:We show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard.

Sep 1, 2020 · We show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard.

We show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard.

Abstract—We show that the problem of finding a Reso- lution refutation that is at most polynomially longer than a shortest one is NP-hard.

Jul 14, 2020 · Namely, regular and ordered Resolution are automatable if and only if P = NP. Specifically, for a CNF formula F the problem of distinguishing ...

Q1: Could we find short proofs under the promise that they exist? Page 10. Theorem: Resolution is not automatable in polynomial-time unless P = ...

It is NP-hard to distinguish between formulas that have Resolution refutations of polynomial length and those that do not have subexponential length ...

Q2: Could the problem be solvable in time polynomial !, ", and # = Res(&)? Proof Search Problem for Resolution. We would say that Resolution is AUTOMATABLE in ...

Jul 14, 2020 · We present a simplified proof and sufficient conditions under which MCSP^* is NP-hard under the standard notion of reduction: MCSP^* is NP-hard ...

We show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard.