Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.

Peter Sanders Rudolf Fleischer

Published in: WAE (2000)

Keyphrases

randomized algorithms
worst case
lower bound
approximation algorithms
upper bound
np hard
data sets
data points
monte carlo
average case