scientific article
From MaRDI portal
Publication:3974991
zbMath0751.05023MaRDI QIDQ3974991
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Matroids, motives, and a conjecture of Kontsevich., Oriented matroids and combinatorial neural codes, Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic, Segment orders, RAC-drawability is \(\exists \mathbb{R} \)-complete, Principal minor ideals and rank restrictions on their vanishing sets, Smoothing the Gap Between NP and ER, Enumerating Neighborly Polytopes and Oriented Matroids, The universal partition theorem for oriented matroids, Realization spaces of arrangements of convex bodies, Barycentric systems and stretchability, Intersection Graphs of Rays and Grounded Segments, When Can Splits be Drawn in the Plane?, Realizability and inscribability for simplicial polytopes via nonlinear optimization, The Complexity of Drawing Graphs on Few Lines and Few Planes, The Complexity of Angular Resolution, Universality theorems for inscribed polytopes and Delaunay triangulations, Qualitative reasoning with directional relations, Sphere and dot product representations of graphs, The complexity of the Hausdorff distance, Complete enumeration of small realizable oriented matroids, RAC-Drawability is ∃ℝ-complete and Related Results, Positive Plücker tree certificates for non-realizability, Topological art in simple galleries, Simple realizability of complete abstract topological graphs in P, The hyperbolic plane, three-body problems, and Mnëv's universality theorem, The universality theorem for neighborly polytopes, On the Complexity of the Planar Slope Number Problem, Variants of the segment number of a graph, Sign rank versus Vapnik-Chervonenkis dimension, On the Pseudolinear Crossing Number, Realization spaces of 4-polytopes are universal, Aligned Drawings of Planar Graphs, Some provably hard crossing number problems, Computational algebraic geometry of projective configurations, Complexity of Geometric k-Planarity for Fixed k, Suballowable sequences and geometric permutations, Inverse problems in models of resource distribution, Recognition and complexity of point visibility graphs, Analyzing restricted fragments of the theory of linear arithmetic, Fixed points, Nash equilibria, and the existential theory of the reals, Recognizing Visibility Graphs of Triangulated Irregular Networks, The real computational complexity of minmax value and equilibrium refinements in multi-player games, The expected codimension of a matroid variety, Non-stretchable pseudo-visibility graphs, An Almost Optimal Algorithm for Computing Nonnegative Rank, Nonrational configurations, polytopes, and surfaces, Cocircuit graphs and efficient orientation reconstruction in oriented matroids, The complexity of tensor rank, Inserting an edge into a geometric embedding, Aligned Drawings of Planar Graphs, Grassmannians and pseudosphere arrangements, Arrangements of pseudocircles and circles, Testing orientability for matroids is NP-complete, Matroid Theory for Algebraic Geometers, Counting polytopes via the Radon complex, Une axiomatisation au premier ordre des arrangements de pseudodroites euclidiennes. (A first-order axiomatisation of arrangements of Euclidean pseudolines.), On the Complexity of Some Geometric Problems With Fixed Parameters, Euclideaness and final polynomials in oriented matroid theory
