A guided tour through oriented matroid axioms
From MaRDI portal
(Redirected from Publication:1314943)
The paper concerns different axiom systems in building oriented matroids, and it is shown how these axiom systems can be deduced from each other. Moreover, the authors compare the different axiom systems with regard to the complexity of matroid algorithms. They show that all systems are inadequate for checking Farkas' Lemma.
Recommendations
Cites work
- Acyclic and totally cyclic orientations of combinatorial geometries
- Geometric algebra for combinatorial geometries
- Grassmann-Plücker relations and matroids with coefficients
- scientific article; zbMATH DE number 3365043 (Why is no real title available?)
- On n-ordered sets and order completeness
- Oriented matroids and multiply ordered sets
Cited in
(6)- An axiomatic of non-Radon partitions of oriented matroids
- Five variations on a theme by Gyula Farkas
- Testing orientability for matroids is NP-complete
- A graph-theoretical axiomatization of oriented matroids
- scientific article; zbMATH DE number 4106867 (Why is no real title available?)
- Kirchberger's Theorem for Complexes of Oriented Matroids
This page was built for publication: A guided tour through oriented matroid axioms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314943)