Login / Signup

Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms.

Tom LeightonPeter W. Shor
Published in: Comb. (1989)
Keyphrases
  • average case
  • worst case
  • tight bounds
  • worst case analysis
  • upper bound
  • uniform distribution
  • learning curves
  • sample complexity bounds
  • learning algorithm
  • theoretical analysis
  • data compression
  • online algorithms