Pages that link to "Item:Q3652279"
From MaRDI portal
The following pages link to Conditional Hardness of Approximating Satisfiable Max 3CSP-q (Q3652279):
Displaying 6 items.
- Approximating satisfiable satisfiability problems (extended abstract) (Q826119) (← links)
- md-MST is NP-hard for \(d\geq 3\) (Q2883542) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Conditional hardness for satisfiable 3-CSPs (Q5172744) (← links)
- The Approximability of Three-valued MAX CSP (Q5470737) (← links)
- (Q5875732) (← links)