Pages that link to "Item:Q5057423"
From MaRDI portal
The following pages link to On the complexity of approximating and illuminating three-dimensional convex polyhedra (Q5057423):
Displaying 6 items.
- The complexity of cutting complexes (Q1115186) (← links)
- On the difficulty of triangulating three-dimensional nonconvex polyhedra (Q1182990) (← links)
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings (Q1350939) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- On triangulating three-dimensional polygons (Q1392846) (← links)
- Nonnegative Matrix Factorization Requires Irrationality (Q5283249) (← links)