The P-matrix problem is co-NP-complete
type: Item
instance of: scholarly article
title: The P-matrix problem is co-NP-complete
zbMATH Open document ID: 0822.90132
DOI: 10.1007/BF01582570
author: Gregory E. Coxson
published in: Mathematical Programming. Series A. Series B
publication date: 1994-08-10T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 617336
zbMATH Keywords: linear complementarity
zbMATH Keywords: interval matrices
zbMATH Keywords: NP-complete
zbMATH Keywords: P-matrix
MaRDI profile type: Publication
cites work: Systems of linear interval equations
cites work: Checking robust nonsingularity is NP-hard
cites work: Q4198056
cites work: Q3254327
cites work: Q5340130
cites work: The Componentwise Distance to the Nearest Singular Matrix
full work available at URL: https://doi.org/10.1007/bf01582570
OpenAlex ID: W2067544030
description: scientific article; zbMATH DE number 617336