Explicit families of CNF formulas exist such that tree-like semantic Frege refutations with line size s(n) require superpolynomial length for most formulas in the family, for s(n) in a broad range from nearly quadratic to subexponential in n.
TFNP Intersections Through the Lens of Feasible Disjunction
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
Explicit families of CNF formulas exist such that tree-like semantic Frege refutations with line size s(n) require superpolynomial length for most formulas in the family, for s(n) in a broad range from nearly quadratic to subexponential in n.