Pages that link to "Item:Q1591363"

The following pages link to Co-NP-completeness of some matrix classification problems (Q1591363):

Displaying 11 items.

• On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
• Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix (Q715065) (← links)
• Computational complexity of problems in classification according to a relation matrix (Q1083849) (← links)
• The P-matrix problem is co-NP-complete (Q1330899) (← links)
• Band-restricted diagonally dominant matrices: computational complexity and application (Q1713483) (← links)
• On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048) (← links)
• The almost semimonotone matrices (Q2302882) (← links)
• Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
• Fast Exact NPN Classification by Co-Designing Canonical Form and Its Computation Algorithm (Q5126050) (← links)
• The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems (Q5167105) (← links)
• Sufficient matrices: properties, generating and testing (Q6596334) (← links)