Hereditary properties of permutations are strongly testable

DOI10.1137/1.9781611973402.86zbMath1423.05006arXiv1208.2624OpenAlexW1927582220WikidataQ105584126 ScholiaQ105584126MaRDI QIDQ5384048

Tereza Klimošová, Daniel Král'

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Related Items (6)

Fast Property Testing and Metrics for Permutations ⋮ Densities in large permutations and parameter testing ⋮ Patterns in random permutations ⋮ Unnamed Item ⋮ Limits of \(k\)-dimensional poset sequences ⋮ Quasi-random words and limits of word sequences

This page was built for publication: Hereditary properties of permutations are strongly testable