The following pages link to (Q4475671):
Displaying 10 items.
- Heuristic-based backtracking relaxation for propositional satisfiability (Q862398) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
- Exploiting relaxation in local search for LABS (Q2468767) (← links)
- A randomized satisfiability procedure for arithmetic and uninterpreted function symbols (Q2486581) (← links)
- The Relation Between Complete and Incomplete Search (Q2950519) (← links)
- Theory and Applications of Satisfiability Testing (Q5325850) (← links)
- Automated Deduction – CADE-19 (Q5900717) (← links)