Approximating satisfiable satisfiability problems (extended abstract)
From MaRDI portal
Recommendations
Cited in
(11)- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximating Succinct MaxSat
- On approximability of satisfiable k -CSPs: I
- On the Approximability of Splitting-SAT in 2-CNF Horn Formulas
- scientific article; zbMATH DE number 6783493 (Why is no real title available?)
- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
- Sparsification of SAT and CSP Problems via Tractable Extensions
- Efficient Approximation of Well-Founded Justification and Well-Founded Domination
- An approximative inference method for solving ∃∀SO satisfiability problems
This page was built for publication: Approximating satisfiable satisfiability problems (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826119)