scientific article; zbMATH DE number 5990521
From MaRDI portal
Publication:3106038
Recommendations
- A geometric inequality and the complexity of computing volume
- scientific article; zbMATH DE number 176915
- The problem of calculating the volume of a polyhedron is enumerably hard
- On the Volume of a Certain Polytope
- scientific article; zbMATH DE number 4201621
- A trick for calculating volumes of non-Euclidean polyhedra
- Seidel's problem on the volume of a non-Euclidean tetrahedron
- scientific article; zbMATH DE number 3893920
- scientific article; zbMATH DE number 3859926
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3106038)