Using oriented matroids to bound the monotone rank of a matrix
From MaRDI portal
Cites work
- A linear lower bound on the unbounded error probabilistic communication complexity.
- Ample completions of oriented matroids and complexes of uniform oriented matroids
- Betti curves of rank one symmetric matrices
- Clique topology reveals intrinsic geometric structure in neural correlations
- Complexity of some geometric and topological problems
- Computing metric hulls in graphs
- COMs: complexes of oriented matroids
- Full Rank Factorization of Matrices
- scientific article; zbMATH DE number 431988 (Why is no real title available?)
- scientific article; zbMATH DE number 4092241 (Why is no real title available?)
- scientific article; zbMATH DE number 17663 (Why is no real title available?)
- Intersection graphs and geometric objects in the plane
- Labeled sample compression schemes for complexes of oriented matroids
- Lectures in real geometry. Elaborated versions of the lectures given at the winter school in real geometry, Madrid, Spain, January 3--7, 1994
- Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten.
- On the decidability of Diophantine problems in combinatorial geometry
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Oriented Matroids
- Probabilistic communication complexity
- Signed difference analysis: testing for structure under monotonicity
- Sweeps, polytopes, oriented matroids, and allowable graphs of permutations
- Two-dimensional partial cubes
- Unlabeled sample compression schemes for oriented matroids
This page was built for publication: Using oriented matroids to bound the monotone rank of a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356625)
