Reversing Longest Previous Factor Tables is Hard

DOI10.1007/978-3-642-22300-6_41zbMath1342.68148OpenAlexW2114454114MaRDI QIDQ5199267

Guang Yang, Hongyu Liang, Jing (Selena) He

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_41

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

Related Items

Universal Reconstruction of a String ⋮ Inferring strings from Lyndon factorization ⋮ Verifying and enumerating parameterized border arrays ⋮ Universal reconstruction of a string ⋮ String inference from longest-common-prefix array