Short Resolution refutations of Ref(φ) yield satisfying assignments for φ in polynomial time via a PV1-formalizable construction, and the Proof Analysis Problem is NP-complete for Extended Frege.
Journal of the American Mathematical Society , volume =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Moonflowers are introduced as set families with per-set unique elements, yielding near-optimal extremal bounds that enable logarithmic code sparsification with a matching lower bound.
citing papers explorer
-
The Proof Analysis Problem
Short Resolution refutations of Ref(φ) yield satisfying assignments for φ in polynomial time via a PV1-formalizable construction, and the Proof Analysis Problem is NP-complete for Extended Frege.
-
Moonflowers and efficient code sparsification
Moonflowers are introduced as set families with per-set unique elements, yielding near-optimal extremal bounds that enable logarithmic code sparsification with a matching lower bound.