Improved Bounds for Testing Forbidden Order Patterns

zbMath1403.68327arXiv1710.10660MaRDI QIDQ4608030

Clément L. Canonne, Omri Ben-Eliezer

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1710.10660

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (5)

Improved algorithm for permutation testing ⋮ Unnamed Item ⋮ Almost Optimal Distribution-Free Sample-Based Testing of k-Modality ⋮ Finding and counting permutations via CSPs ⋮ Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity

This page was built for publication: Improved Bounds for Testing Forbidden Order Patterns