The following pages link to (Q4473048):
Displayed 8 items.
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- Heuristic-based backtracking relaxation for propositional satisfiability (Q862398) (← links)
- Iterative restart technique for solving timetabling problems. (Q1417483) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- Efficient data structures for backtrack search SAT solvers (Q1777399) (← links)
- The state of SAT (Q2643296) (← links)
- BerkMin: A fast and robust SAT-solver (Q2643301) (← links)
- Random backtracking in backtrack search algorithms for satisfiability (Q2643305) (← links)