Pages that link to "Item:Q5892172"

The following pages link to Parameterized Complexity of DPLL Search Procedures (Q5892172):

Displaying 10 items.

• Proof complexity of modal resolution (Q832717) (← links)
• Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
• The complexity of proving that a graph is Ramsey (Q1705815) (← links)
• Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
• Large clique is hard on average for resolution (Q2117104) (← links)
• A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
• A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
• Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
• Narrow Proofs May Be Maximally Long (Q5277920) (← links)
• Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)