Checking robust nonsingularity is NP-hard
type: Item
instance of: scholarly article
title: Checking robust nonsingularity is NP-hard
zbMATH Open document ID: 0780.93027
DOI: 10.1007/BF01213466
author: Svatopluk Poljak
author: Jiří Rohn
published in: MCSS. Mathematics of Control, Signals, and Systems
publication date: 1994-01-26T00:00:00Z
Mathematics Subject Classification ID: 93B35
zbMATH DE Number: 202973
zbMATH Keywords: robust nonsingularity
zbMATH Keywords: interval matrices
zbMATH Keywords: radius of nonsingularity
Wikidata QID: Q92958254
MaRDI profile type: Publication
cites work: A solvable case of quadratic 0-1 programming
cites work: Minimization of ±1 matrices under line shifts
cites work: Q3026160
cites work: Laplacian eigenvalues and the maximum cut problem
cites work: Facets for the cut cone. I
cites work: Q4065548
cites work: Q4198056
cites work: Complexity of Partial Satisfaction
cites work: Q5202209
cites work: Tournament Ranking with Expected Profit in Polynomial Time
cites work: A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
cites work: Systems of linear interval equations
cites work: Q3818127
cites work: Q5807665
full work available at URL: https://doi.org/10.1007/bf01213466
OpenAlex ID: W2022602688
DBLP publication ID: journals/mcss/PoljakR93
description: scientific article; zbMATH DE number 202973