Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor.
Alexander I. BarvinokPublished in: Random Struct. Algorithms (1999)
Keyphrases
- computational complexity
- computational cost
- worst case
- optimization problems
- search algorithm
- orders of magnitude
- special case
- computationally efficient
- exact and approximate
- database
- recently developed
- times faster
- theoretical analysis
- data sets
- significant improvement
- data mining algorithms
- data structure
- combinatorial optimization
- face recognition