Pages that link to "Item:Q1045886"
From MaRDI portal
The following pages link to On the hardness of approximating max-satisfy (Q1045886):
Displaying 15 items.
- More on average case vs approximation complexity (Q430823) (← links)
- On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (Q466374) (← links)
- A well-characterized approximation problem (Q688442) (← links)
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- Minimal achievable approximation ratio for MAX-MQ in finite fields (Q1019747) (← links)
- On approximating NP-hard optimization problems (Q1126838) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Pricing on paths: a PTAS for the highway problem (Q2796210) (← links)
- \(\mathcal{NP}\)-hardness of approximately solving linear equations over reals (Q2848199) (← links)
- Satisfying degree-\(d\) equations over \(\mathrm{GF}[2]^n\) (Q3191597) (← links)
- Conditional Hardness of Approximating Satisfiable Max 3CSP-q (Q3652279) (← links)
- (Q5121902) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313015) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)