A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541)
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: A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor |
scientific article |
Statements
A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (English)
0 references
6 May 2009
0 references
convex sets
0 references
mixed volume
0 references
convex optimization
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
0.8816806674003601
0 references
0.8672053813934326
0 references
0.8544886112213135
0 references
