Login / Signup
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time.
Gábor Erdélyi
Lane A. Hemaspaandra
Jörg Rothe
Holger Spakowski
Published in:
FCT (2007)
Keyphrases
</>
average case
worst case
worst case analysis
competitive ratio
approximation algorithms
upper bound
np hard
computational complexity
learning curves
uniform distribution
lower bound
special case
active learning
dynamic programming
online algorithms
decision trees
average case complexity