On the hardness of efficiently approximating maximal non-\(L\) submatrices. (Q1418978): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2003.08.014 / rank
Normal rank
 
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
Property / cites work
 
Property / cites work: Qualitative Economics and the Scope of the Correspondence Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional sign-solvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3634242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Theorems for Conditional Sign-Solvability and Sign-Solvability of General Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of maximum splitting of k-sets and some other Apx-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signsolvability revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretical approach to qualitative solvability of linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even dicycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanents, Pfaffian orientations, and even directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5787677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets, Approximation, and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2003.08.014 / rank
 
Normal rank

Latest revision as of 19:51, 10 December 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
    0 references
    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

    Identifiers