Pages that link to "Item:Q4651510"

The following pages link to A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution (Q4651510):

Displaying 18 items.

• Relativization makes contradictions harder for resolution (Q386151) (← links)
• The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
• Lower bounds for \(k\)-DNF resolution on random 3-CNFs (Q430840) (← links)
• Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
• Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) (Q835026) (← links)
• A note about \(k\)-DNF resolution (Q1641156) (← links)
• On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
• The treewidth of proofs (Q2013559) (← links)
• Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
• Partially definable forcing and bounded arithmetic (Q2257103) (← links)
• Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
• FRAGMENTS OF APPROXIMATE COUNTING (Q2921008) (← links)
• On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
• Short Proofs Are Hard to Find (Q5091243) (← links)
• Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
• (Q5092398) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765) (← links)