On the hardness of efficiently approximating maximal non-\(L\) submatrices. (Q1418978): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2003.08.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1976590285 / rank | |||
Normal rank | |||
Revision as of 22:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of efficiently approximating maximal non-\(L\) submatrices. |
scientific article |
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
