Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Artem Ilikaev"'
Publikováno v:
Mathematics, Vol 10, Iss 3, p 377 (2022)
We study algorithms for solving three problems on strings. These are sorting of n strings of length k, “the Most Frequent String Search Problem”, and “searching intersection of two sequences of strings”. We construct quantum algorithms that a
Externí odkaz:
https://doaj.org/article/6873653bc38649a480a64537447a5cf2
Autor:
Kamil Khadiev, Artem Ilikaev
Publikováno v:
Theory and Practice of Natural Computing ISBN: 9783030344993
We study algorithms for solving three problems on strings. The first one is the Most Frequently String Search Problem. The problem is the following. Assume that we have a sequence of $n$ strings of length $k$. The problem is finding the string that o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7512e18fe83f41eb22159599b212e2b7
https://doi.org/10.1007/978-3-030-34500-6_17
https://doi.org/10.1007/978-3-030-34500-6_17
