Pages that link to "Item:Q6487958"
From MaRDI portal
The following pages link to An approximation algorithm for MAX 3-SAT (Q6487958):
Displaying 10 items.
- MAX3SAT is exponentially hard to approximate if NP has positive dimension. (Q1853564) (← links)
- Improved approximation algorithms for MAX SAT (Q2777611) (← links)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
- Conditional Hardness of Approximating Satisfiable Max 3CSP-q (Q3652279) (← links)
- (Q4250183) (← links)
- On the Approximation of Maximum Satisfiability (Q4314502) (← links)
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem (Q4317711) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313047) (← links)
- The Approximability of Three-valued MAX CSP (Q5470737) (← links)
- (Q5875650) (← links)