Pages that link to "Item:Q2577593"
From MaRDI portal
The following pages link to Hard satisfiable instances for DPLL-type algorithms (Q2577593):
Displaying 6 items.
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399) (← links)
- A two-phase algorithm for solving a class of hard satisfiability problems (Q1306378) (← links)
- Hard satisfiable formulas for splittings by linear combinations (Q1680241) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- Automata, Languages and Programming (Q5466449) (← links)