Comment on 'Complexity Analyses of Event Set Algorithms'.

Robert M. O'Keefe

Published in: Comput. J. (1985)

Keyphrases

worst case
computational cost
polynomial time complexity
high computational complexity
small number
theoretical analysis

recently developed
computational complexity
computationally efficient
event detection
data structure
reduced complexity

lower complexity
times faster
significant improvement
learning algorithm
orders of magnitude

memory requirements
complexity analysis
machine learning algorithms
lower bound
computationally complex