Pages that link to "Item:Q1591363"

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

Displayed 5 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)
• 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)
• The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems (Q5167105) ‎ (← links)