Block Sorting is Hard
From MaRDI portal
Publication:5696919
DOI10.1142/S0129054103001820zbMath1075.68577MaRDI QIDQ5696919
Shahram Latifi, Lawrence L. Larmore, Wolfgang W. Bein, Ivan Hal Sudborough
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Searching and sorting (68P10) Pattern recognition, speech recognition (68T10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
APPROXIMATE BLOCK SORTING ⋮ Block Sorting Is APX-Hard ⋮ A quadratic time 2-approximation algorithm for block sorting ⋮ Bounding prefix transposition distance for strings and permutations
Cites Work
This page was built for publication: Block Sorting is Hard