The following pages link to (Q4247437):
Displaying 13 items.
- A nonmonotone GRASP (Q340011) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- Solving weighted MAX-SAT via global equilibrium search (Q1003491) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- (Q2741521) (← links)
- Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery (Q5002784) (← links)
- Practical applications of the alternating cycle decomposition (Q6535610) (← links)
