Finding monotone patterns in sublinear time

Omri Ben-Eliezer
Omri Ben-Eliezer
Shoham Letzter
Shoham Letzter
Erik Waingarten
Erik Waingarten

foundations of computer science, pp. 1469-1494, 2019.

Cited by: 1|Bibtex|Views4|
EI

Abstract:

We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed $k \in \mathbb{N}$ and $\varepsilon > 0$, we show that the non-adaptive query complexity of finding a length-$k$ monotone subsequence of $f \colon [n] \to \mathbb{R}$, assuming that $f$ is $\varepsilon$-far from free o...More

Code:

Data:

Your rating :
0

 

Tags
Comments