Pages that link to "Item:Q826119"
From MaRDI portal
The following pages link to Approximating satisfiable satisfiability problems (extended abstract) (Q826119):
Displaying 11 items.
- Approximating satisfiable satisfiability problems (Q1578395) (← 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)
- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) (Q3521946) (← links)
- Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width (Q4914311) (← links)
- Sparsification of SAT and CSP Problems via Tractable Extensions (Q5053064) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313018) (← links)
- (Q5365140) (← links)
- Approximating Succinct MaxSat (Q5696308) (← links)
- On approximability of satisfiable <i>k</i> -CSPs: I (Q6083552) (← links)