Papers
Topics
Authors
Recent
Search
2000 character limit reached

Finding monotone patterns in sublinear time

Published 3 Oct 2019 in cs.DS and cs.DM | (1910.01749v1)

Abstract: We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed k∈Nk \in \mathbb{N} and ε>0\varepsilon > 0, we show that the non-adaptive query complexity of finding a length-kk monotone subsequence of f ⁣:[n]→Rf \colon [n] \to \mathbb{R}, assuming that ff is ε\varepsilon-far from free of such subsequences, is Θ((log⁡n)⌊log⁡2k⌋)\Theta((\log n)^{\lfloor \log_2 k \rfloor}). Prior to our work, the best algorithm for this problem, due to Newman, Rabinovich, Rajendraprasad, and Sohler (2017), made (log⁡n)O(k2)(\log n)^{O(k^2)} non-adaptive queries; and the only lower bound known, of Ω(log⁡n)\Omega(\log n) queries for the case k=2k = 2, followed from that on testing monotonicity due to Erg\"un, Kannan, Kumar, Rubinfeld, and Viswanathan (2000) and Fischer (2004).

Citations (11)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.