Generalizing and derandomizing Gurvits's approximation algorithm for the permanent.
Scott AaronsonTravis HancePublished in: Quantum Inf. Comput. (2014)
Keyphrases
- high accuracy
- computational complexity
- recognition algorithm
- preprocessing
- search space
- k means
- improved algorithm
- detection algorithm
- computational cost
- experimental evaluation
- np hard
- cost function
- significant improvement
- closed form
- matching algorithm
- times faster
- error bounds
- objective function
- theoretical analysis
- computationally efficient
- lower bound
- particle swarm optimization
- simulated annealing
- clustering method
- tree structure
- dynamic programming
- special case
- video sequences
- optimal solution
- genetic algorithm
- approximation ratio
- error tolerance