Polynomial time algorithms to approximate mixed volumes within a simply exponential factor.
Leonid GurvitsPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- learning algorithm
- computational complexity
- worst case
- special case
- computationally efficient
- benchmark datasets
- orders of magnitude
- computationally expensive
- computationally tractable
- data sets
- computational problems
- space complexity
- approximation algorithms
- recently developed
- combinatorial optimization
- computational efficiency
- data structure
- three dimensional
- neural network