Pages that link to "Item:Q2898031"
From MaRDI portal
The following pages link to Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms (Q2898031):
Displaying 6 items.
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- On Some Recent Approximation Algorithms for MAX SAT (Q5405076) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)