Checking robust nonsingularity is NP-hard (Q1802197): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q92958254, #quickstatements; #temporary_batch_1705097318925
Created claim: DBLP publication ID (P1635): journals/mcss/PoljakR93, #quickstatements; #temporary_batch_1739204820419
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of ±1 matrices under line shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for the cut cone. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Partial Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament Ranking with Expected Profit in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of linear interval equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01213466 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022602688 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mcss/PoljakR93 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:28, 10 February 2025

scientific article
Language Label Description Also known as
English
Checking robust nonsingularity is NP-hard
scientific article

    Statements

    Checking robust nonsingularity is NP-hard (English)
    0 references
    0 references
    0 references
    26 January 1994
    0 references
    robust nonsingularity
    0 references
    interval matrices
    0 references
    radius of nonsingularity
    0 references

    Identifiers