The following pages link to (Q2753735):
Displaying 4 items.
- On the hardness of efficiently approximating maximal non-\(L\) submatrices. (Q1418978) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- Inapproximability results for set splitting and satisfiability problems with no mixed clauses (Q1879246) (← links)
- The geometry of differential privacy: the small database and approximate cases (Q2805515) (← links)