Pages that link to "Item:Q5405076"
From MaRDI portal
The following pages link to On Some Recent Approximation Algorithms for MAX SAT (Q5405076):
Displaying 14 items.
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- On the hardness of approximating max-satisfy (Q1045886) (← links)
- Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
- Approximating a generalization of MAX 2SAT and MIN 2SAT (Q1841882) (← links)
- Simple Approximation Algorithms for Balanced MAX 2SAT (Q2802976) (← links)
- (Q4229151) (← links)
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem (Q4317711) (← links)
- On Approximation Algorithms for Hierarchical MAX-SAT (Q4377125) (← links)
- (Q4524463) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- Theory and Applications of Satisfiability Testing (Q5714749) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
