On degeneracy in the P-matroid oriented matroid complementarity problem
From MaRDI portal
Cites work
- Complementarity in Oriented Matroids
- Counting unique-sink orientations
- Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
- Enumeration of PLCP-orientations of the 4-cube
- Finding the sink takes some time: An almost quadratic lower bound for finding the sink of unique sink oriented cubes
- Fundamentals of Computation Theory
- Hardness and approximation of minimum convex partition
- How easy is local search?
- scientific article; zbMATH DE number 3639651 (Why is no real title available?)
- Linear programming and unique sink orientations
- On the complexity of the parity argument and other inefficient proofs of existence
- On total functions, existence theorems and computational complexity
- Oriented Matroids
- Pivoting in linear complementarity: Two polynomial-time cases
- Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
- The complexity of recognizing unique sink orientations
- The Linear Complementarity Problem
- The P-matrix problem is co-NP-complete
- Two choices are enough for P-LCPs, USOs, and colorful tangents
- Unique end of potential line
- Unique sink orientations of cubes
- Unique sink orientations of grids
This page was built for publication: On degeneracy in the P-matroid oriented matroid complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305052)
