Approximating satisfiable satisfiability problems
From MaRDI portal
Recommendations
Cited in
(20)- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Tight bound on Johnson's algorithm for maximum satisfiability
- scientific article; zbMATH DE number 1670538 (Why is no real title available?)
- Approximating satisfiable satisfiability problems (extended abstract)
- Solving QSAT in sublinear depth
- 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
- The quest for strong inapproximability results with perfect completeness
- scientific article; zbMATH DE number 5575002 (Why is no real title available?)
- scientific article; zbMATH DE number 6783493 (Why is no real title available?)
- scientific article; zbMATH DE number 1559517 (Why is no real title available?)
- Efficient Approximation of Well-Founded Justification and Well-Founded Domination
- Logic Programming and Nonmonotonic Reasoning
- A refined branching algorithm for the maximum satisfiability problem
- An approximative inference method for solving ∃∀SO satisfiability problems
- A nonmonotone GRASP
- scientific article; zbMATH DE number 1775443 (Why is no real title available?)
- 3-bit dictator testing: 1 vs. 5/8
This page was built for publication: Approximating satisfiable satisfiability problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1578395)
