The following pages link to (Q3974991):
Displaying 50 items.
- Principal minor ideals and rank restrictions on their vanishing sets (Q330162) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
- Qualitative reasoning with directional relations (Q622129) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- The complexity of tensor rank (Q722207) (← links)
- Arrangements of pseudocircles and circles (Q741610) (← links)
- Barycentric systems and stretchability (Q885280) (← links)
- Universality theorems for inscribed polytopes and Delaunay triangulations (Q894687) (← links)
- Suballowable sequences and geometric permutations (Q942103) (← links)
- Nonrational configurations, polytopes, and surfaces (Q976302) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- Computational algebraic geometry of projective configurations (Q1176393) (← links)
- Une axiomatisation au premier ordre des arrangements de pseudodroites euclidiennes. (A first-order axiomatisation of arrangements of Euclidean pseudolines.) (Q1296148) (← links)
- Euclideaness and final polynomials in oriented matroid theory (Q1311016) (← links)
- Realizability and inscribability for simplicial polytopes via nonlinear optimization (Q1683692) (← links)
- The hyperbolic plane, three-body problems, and Mnëv's universality theorem (Q1702809) (← links)
- The universality theorem for neighborly polytopes (Q1705807) (← links)
- Inverse problems in models of resource distribution (Q1742965) (← links)
- Testing orientability for matroids is NP-complete (Q1809523) (← links)
- Counting polytopes via the Radon complex (Q1826858) (← links)
- Matroids, motives, and a conjecture of Kontsevich. (Q1872789) (← links)
- The universal partition theorem for oriented matroids (Q1911765) (← links)
- Complete enumeration of small realizable oriented matroids (Q1943649) (← links)
- Grassmannians and pseudosphere arrangements (Q2041576) (← links)
- RAC-drawability is \(\exists \mathbb{R} \)-complete (Q2151432) (← links)
- Variants of the segment number of a graph (Q2206875) (← links)
- The expected codimension of a matroid variety (Q2256053) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- Segment orders (Q2380782) (← links)
- Realization spaces of arrangements of convex bodies (Q2408184) (← links)
- Non-stretchable pseudo-visibility graphs (Q2486082) (← links)
- Matroid Theory for Algebraic Geometers (Q2833351) (← links)
- On the Complexity of the Planar Slope Number Problem (Q2971391) (← links)
- On the Pseudolinear Crossing Number (Q2978177) (← links)
- Enumerating Neighborly Polytopes and Oriented Matroids (Q3194584) (← links)
- Polynomial realization of pseudoline arrangements (Q3749685) (← links)
- Intersection Graphs of Rays and Grounded Segments (Q4585058) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- Aligned Drawings of Planar Graphs (Q4625095) (← links)
- Realization spaces of 4-polytopes are universal (Q4884444) (← links)
- Aligned Drawings of Planar Graphs (Q4961753) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- Complexity of Geometric k-Planarity for Fixed k (Q5144878) (← links)
- Recognizing Visibility Graphs of Triangulated Irregular Networks (Q5164862) (← links)
- When Can Splits be Drawn in the Plane? (Q5346560) (← links)
- An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610) (← links)
- On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
