Pages that link to "Item:Q1675824"

The following pages link to A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824):

Displaying 11 items.

• Relativization makes contradictions harder for resolution (Q386151) (← links)
• A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824) (← links)
• Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
• A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
• A characterization of tree-like resolution size (Q2444907) (← links)
• A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
• A Tutorial on Time and Space Bounds in Tree-Like Resolution (Q2821700) (← links)
• Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
• Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
• (Q5092479) (← links)
• Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)