Pages that link to "Item:Q5466449"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466449):
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)
- Hard satisfiable formulas for splittings by linear combinations (Q1680241) (← links)
- A SAT-based parser and completer for pictures specified by tiling (Q2459547) (← links)
- Hard satisfiable instances for DPLL-type algorithms (Q2577593) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)