Solving 3-Superstring in 3 n/3 Time

DOI10.1007/978-3-642-40313-2_43zbMath1398.68238OpenAlexW28646649MaRDI QIDQ2849936

Ivan Mihajlin, Alexander Golovnev, Alexander S. Kulikov

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (2)

Parameterized complexity of superstring problems ⋮ Solving SCS for bounded length strings in fewer than \(2^n\) steps

This page was built for publication: Solving 3-Superstring in 3 n/3 Time