Pages that link to "Item:Q1578395"
From MaRDI portal
The following pages link to Approximating satisfiable satisfiability problems (Q1578395):
Displaying 17 items.
- A nonmonotone GRASP (Q340011) (← links)
- Approximating satisfiable satisfiability problems (extended abstract) (Q826119) (← links)
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- Solving QSAT in sublinear depth (Q2328327) (← links)
- Efficient Approximation of Well-Founded Justification and Well-Founded Domination (Q2851261) (← links)
- On the Approximability of Splitting-SAT in 2-CNF Horn Formulas (Q2870016) (← links)
- An approximative inference method for solving ∃∀SO satisfiability problems (Q3143568) (← links)
- (Q3634956) (← links)
- A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction (Q4526965) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313018) (← links)
- (Q5365140) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5473961) (← links)
- Approximating Succinct MaxSat (Q5696308) (← links)
- On approximability of satisfiable <i>k</i> -CSPs: I (Q6083552) (← links)