Representing matroids over the reals is \(\exists \mathbb{R}\)-complete

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Sphere and dot product representations of graphs
Fixed points, Nash equilibria, and the existential theory of the reals
Bounding the radii of balls meeting every connected component of semi-algebraic sets
The complexity of tensor rank
Testing branch-width
Certifying non-representability of matroids over prime fields
A parameterized view on matroid optimization problems
Matroid matching and some applications
Intersection graphs of segments
The asymptotic number of geometries
On the efficiency of representability tests for matroids
Integer realizations of disk and segment graphs
Flag matroids: algebra and geometry
Solving Rota's Conjecture
Complexity of Some Geometric and Topological Problems
Matroid Complexity and Nonsuccinct Descriptions
Complexity of Matroid Property Algorithms
Intersection Graphs of Rays and Grounded Segments
On Restricted Nonnegative Matrix Factorization
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.
Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games
Oriented Matroids
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
Realization spaces of 4-polytopes are universal
Excluded minors for the class of split matroids
Finding Branch-Decompositions of Matroids, Hypergraphs, and More
The Complexity of Drawing a Graph in a Polygonal Region
Representative Sets and Irrelevant Vertices
Complexity of Geometric k-Planarity for Fixed k
The art gallery problem is ∃ ℝ-complete
On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
The Complexity of Positive Semidefinite Matrix Factorization
On Matroid Representability and Minor Problems
On the computational complexity of decision problems about multi-player Nash equilibria
Excluded minors for matroids satisfying Kinser's inequalities
Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
Topological art in simple galleries
The complexity of the Hausdorff distance

This page was built for publication: Representing matroids over the reals is \(\exists \mathbb{R}\)-complete