Login / Signup

Estimating the Longest Increasing Subsequence in Nearly Optimal Time.

Alexandr AndoniNegev Shekel NosatzkiSandip SinhaClifford Stein
Published in: FOCS (2022)
Keyphrases
  • dynamic programming
  • pattern matching
  • optimal design
  • data structure
  • multi objective
  • computer vision
  • case study
  • support vector
  • upper bound
  • optimal control
  • optimal strategy