Publication:2753735
From MaRDI portal
zbMath0976.68075MaRDI QIDQ2753735
Publication date: 11 November 2001
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
On the hardness of efficiently approximating maximal non-\(L\) submatrices., Improved approximations for max set splitting and max NAE SAT