Euclideaness and final polynomials in oriented matroid theory

DOI10.1007/BF01202352zbMath0789.05024OpenAlexW101194202MaRDI QIDQ1311016

Jürgen Richter-Gebert

Publication date: 12 June 1994

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202352

zbMATH Keywords

algorithmoriented matroidsEuclideanessfinal polynomial

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial aspects of matroids and geometric lattices (05B35) Algebraization in linear incidence geometry (51A25)

Related Items

General non-realizability certificates for spheres with linear programming ⋮ Every non-Euclidean oriented matroid admits a biquadratic final polynomial ⋮ Combinatorial obstructions to the lifting of weaving diagrams

Cites Work

• Unnamed Item
• On the finding of final polynomials
• Computational synthetic geometry
• A combinatorial abstraction of linear programming

This page was built for publication: Euclideaness and final polynomials in oriented matroid theory