The problem of calculating the volume of a polyhedron is enumerably hard (Q3034820)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The problem of calculating the volume of a polyhedron is enumerably hard |
scientific article; zbMATH DE number 4133495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The problem of calculating the volume of a polyhedron is enumerably hard |
scientific article; zbMATH DE number 4133495 |
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
