Login / Signup

Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions.

Ilias DiakonikolasDaniel M. KaneVladimir Nikishkin
Published in: FOCS (2015)
Keyphrases
  • worst case
  • lower bound
  • learning algorithm
  • significant improvement
  • structured data
  • times faster
  • data structure
  • computational cost
  • branch and bound algorithm
  • exhaustive search
  • upper and lower bounds