Nearly Linear Time Algorithms for Permutation Groups with a Small Base.
László BabaiGene CoopermanLarry FinkelsteinÁkos SeressPublished in: ISSAC (1991)
Keyphrases
- theoretical analysis
- computational efficiency
- computational complexity
- data structure
- significant improvement
- worst case
- orders of magnitude
- computationally efficient
- real time
- multi class
- small number
- optimization problems
- computationally expensive
- benchmark datasets
- computational cost
- image sequences
- database systems