Representing Matroids over the Reals is $\exists \mathbb R$-complete
A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies $I'\in I$, and (iii) $I_1,I_2 \in I$ and $|I_1| &...
Saved in:
| Main Authors: | Eun Jung Kim, Arnaud de Mesmay, Tillmann Miltzow |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2024-08-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/10810/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Treewidth 2 in the Planar Graph Product Structure Theorem
by: Marc Distel, et al.
Published: (2025-03-01) -
A new discrete theory of pseudoconvexity
by: Balázs Keszegh
Published: (2023-05-01) -
Distinct Angles and Angle Chains in Three Dimensions
by: Ruben Ascoli, et al.
Published: (2023-02-01) -
Maker-Breaker domination game on trees when Staller wins
by: Csilla Bujtás, et al.
Published: (2023-09-01) -
A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles
by: Jie Zhang, et al.
Published: (2023-12-01)