Pages that link to "Item:Q2913811"
From MaRDI portal
The following pages link to Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set (Q2913811):
Displaying 9 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Inapproximability results for set splitting and satisfiability problems with no mixed clauses (Q1879246) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- On the Approximability of Splitting-SAT in 2-CNF Horn Formulas (Q2870016) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Nearly Optimal NP-Hardness of Unique Coverage (Q5269824) (← links)