Abstract
A sequence f : {1; : : : ; n} → R contains a permutation π of length k if there exist i1 < ... < ik such that, for all x; y, f(ix) < f(iy) if and only if (ix)
Cite
CITATION STYLE
APA
Ben-Eliezer, O., & Canonne, C. L. (2018). Improved bounds for testing forbidden order patterns. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2093–2112). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975031.137
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free