On The Complexity of Computing Mixed Volumes (Q4388877): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539794278384 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005392884 / rank | |||
Normal rank | |||
Latest revision as of 10:20, 30 July 2024
scientific article; zbMATH DE number 1150641
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On The Complexity of Computing Mixed Volumes |
scientific article; zbMATH DE number 1150641 |
Statements
On The Complexity of Computing Mixed Volumes (English)
0 references
10 May 1998
0 references
computational convexity
0 references
volume
0 references
mixed volumes
0 references
convex body
0 references
polytope
0 references
zonotope
0 references
parallelotope
0 references
computation
0 references
approximation
0 references
computational complexity
0 references
deterministic algorithm
0 references
randomized algorithm
0 references
polynomial-time algorithm
0 references
NP-hardness
0 references
\(\# P\)-hardness
0 references
permanent
0 references
determinant problems
0 references
lattice point enumerator
0 references
partial order
0 references
Newton polytope
0 references
polynomial equations
0 references
