The computational complexity of duality (Q2832893)
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 computational complexity of duality |
scientific article; zbMATH DE number 6652982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of duality |
scientific article; zbMATH DE number 6652982 |
Statements
15 November 2016
0 references
dual norm
0 references
dual cone
0 references
Fenchel dual
0 references
NP-hard
0 references
weak membership
0 references
approximation
0 references
norm ball
0 references
proper cone
0 references
polynomial-time reducible
0 references
symmetric convex body
0 references
Mahler volume
0 references
0 references
0 references
The computational complexity of duality (English)
0 references
0.7553328275680542
0 references
0.7517951130867004
0 references
0.7324715852737427
0 references
0.7319777607917786
0 references
