A formal framework for stringology

DOI10.1016/j.dam.2018.03.010zbMath1434.68742OpenAlexW2791670565WikidataQ130069415 ScholiaQ130069415MaRDI QIDQ2295636

Neerja Mhaskar, Michael Soltys

Publication date: 14 February 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.010

zbMATH Keywords

string algorithmsproof complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Complexity of proofs (03F20) Algorithms on strings (68W32)

Cites Work

• Constructing an indeterminate string from its associated graph
• Unshuffling a square is NP-hard
• Unnamed Item
• Unnamed Item

This page was built for publication: A formal framework for stringology