The problem of calculating the volume of a polyhedron is enumerably hard (Q3034820)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The problem of calculating the volume of a polyhedron is enumerably hard |
scientific article |
Statements
The problem of calculating the volume of a polyhedron is enumerably hard (English)
0 references
1989
0 references
computational complexity
0 references
polyhedron
0 references
