A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2012.08.013
@@ Property / DOI: 10.1016/j.orl.2012.08.013 / rank @@
-Normal rank
@@ Property / cites work @@
+NP-completeness of the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+On the solution of large, structured linear complementarity problems: The tridiagonal case
+Normal rank
@@ Property / cites work @@
+Minkowski matrices.
@@ Property / cites work: Minkowski matrices. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365081
@@ Property / cites work: Q5365081 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear complementarity problems solvable by A single linear program
+Normal rank
@@ Property / cites work @@
+Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+A Partition Theorem for Euclidean n-Space
@@ Property / cites work: A Partition Theorem for Euclidean n-Space / rank @@
+Normal rank
@@ Property / cites work @@
+Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2012.08.013
@@ Property / DOI: 10.1016/J.ORL.2012.08.013 / rank @@
+Normal rank