Pages that link to "Item:Q5713737"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing (Q5713737):
Displaying 11 items.
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms (Q2424882) (← links)
- Automatic generation of redundant models for permutation constraint satisfaction problems (Q2460256) (← links)
- SAT-Based Formula Simplification (Q3453233) (← links)
- Improved MaxSAT Algorithms for Instances of Degree 3 (Q3467831) (← links)
- Automatic generation of rule-based constraint solvers over finite domains (Q5277694) (← links)
- Itauto: An Extensible Intuitionistic SAT Solver (Q6157250) (← links)
