Lower Bounds on Generic Algorithms in Groups.
Ueli M. MaurerStefan WolfPublished in: EUROCRYPT (1998)
Keyphrases
- lower bound
- data structure
- theoretical analysis
- computationally efficient
- learning algorithm
- computational complexity
- data sets
- worst case
- times faster
- computational cost
- upper bound
- np hard
- domain specific
- search algorithm
- image segmentation
- computational efficiency
- decision trees
- branch and bound
- upper and lower bounds
- memory efficient
- external memory
- running times