Pages that link to "Item:Q5892559"
From MaRDI portal
The following pages link to Parameterized Complexity of DPLL Search Procedures (Q5892559):
Displaying 4 items.
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- A characterization of tree-like resolution size (Q2444907) (← links)
- Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
