Pages that link to "Item:Q5050006"
From MaRDI portal
The following pages link to The Complexity of Drawing a Graph in a Polygonal Region (Q5050006):
Displaying 4 items.
- The complexity of the Hausdorff distance (Q6145675) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems (Q6566472) (← links)
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
