Publisher
Springer Nature Switzerland
Reference34 articles.
1. Abboud, A., Williams, V.V., Weimann, O.: Consequences of faster alignment of sequences. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 39–51. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-43948-7_4
2. LNCS;A Afshar,2023
3. Backurs, A., Tzamos, C.: Improving viterbi is hard: better runtimes imply faster clique algorithms. In: Proceedings of the 34th International Conference on Machine Learning (ICML 2017), vol. 70, pp. 311–321. JMLR.org (2017)
4. LNCS;M Ball,2020
5. Barrington, D.A.M.: Bounded-width polynomial-size branching programs recognize exactly those languages in $$\text{NC}^1$$. In: 18th ACM STOC, pp. 1–5. ACM Press (1986)