Pages that link to "Item:Q3784042"
From MaRDI portal
The following pages link to On the decidability of Diophantine problems in combinatorial geometry (Q3784042):
Displaying 15 items.
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- Nonrealizability proofs in computational geometry (Q912857) (← links)
- All \(11_ 3\) and \(12_ 3\)-configurations are rational (Q923089) (← links)
- Computational algebraic geometry of projective configurations (Q1176393) (← links)
- Quadratic forms over \(C[t_ 1,t_ 2]\) (Q1176651) (← links)
- Diophantine undecidability of \({\mathbb{C}{}}(t_ 1,t_ 2)\) (Q1194191) (← links)
- Algebraic matroids and Frobenius flocks (Q1682011) (← links)
- On the matroid stratification of Grassmann varieties, specialization of coordinates, and a problem of N. White (Q2277466) (← links)
- Representability of matroids by \(c\)-arrangements is undecidable (Q2696633) (← links)
- Matroid Theory for Algebraic Geometers (Q2833351) (← links)
- On the Complexity of the Planar Slope Number Problem (Q2971391) (← links)
- On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes (Q3971327) (← links)
- Self-polar polytopes (Q4998744) (← links)
- (Q5111017) (← links)
- Oriented matroids and combinatorial neural codes (Q5886261) (← links)
