On the hardness of efficiently approximating maximal non-\(L\) submatrices. (Q1418978)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the hardness of efficiently approximating maximal non-\(L\) submatrices. |
scientific article; zbMATH DE number 2026896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of efficiently approximating maximal non-\(L\) submatrices. |
scientific article; zbMATH DE number 2026896 |
Statements
On the hardness of efficiently approximating maximal non-\(L\) submatrices. (English)
0 references
14 January 2004
0 references
\(L\)-matrix
0 references
Inapproximability
0 references
Approximation-preserving reductions
0 references
2-SAT
0 references
Satisfiability
0 references
Complexity
0 references
Sign-solvability
0 references
Qualitative linear algebra
0 references
0 references
0 references
