Pages that link to "Item:Q1045886"
From MaRDI portal
The following pages link to On the hardness of approximating max-satisfy (Q1045886):
Displaying 6 items.
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Pricing on paths: a PTAS for the highway problem (Q2796210) (← links)
- Conditional Hardness of Approximating Satisfiable Max 3CSP-q (Q3652279) (← links)
- (Q5121902) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
