A deterministic polynomial time algorithm for non-commutative rational identity testing.
Ankit GargLeonid GurvitsRafael Mendes de OliveiraAvi WigdersonPublished in: CoRR (2015)
Keyphrases
- computational complexity
- learning algorithm
- times faster
- worst case
- dynamic programming
- experimental evaluation
- improved algorithm
- recognition algorithm
- high accuracy
- similarity measure
- detection algorithm
- search space
- probabilistic model
- segmentation algorithm
- computationally efficient
- objective function
- preprocessing
- computational cost
- lower bound
- randomized algorithms
- np hardness
- decision making
- image segmentation
- clustering method
- optimization algorithm
- theoretical analysis
- significant improvement
- expectation maximization
- input data
- simulated annealing
- special case
- cost function
- neural network