Estimating the Longest Increasing Subsequence in Nearly Optimal Time

Alexandr Andoni, Negev Shekel Nosatzki, Sandip Sinha, Clifford Stein 0001. Estimating the Longest Increasing Subsequence in Nearly Optimal Time. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022. pages 708-719, IEEE, 2022. [doi]

Abstract

Abstract is missing.