Zobrazeno 1 - 10
of 395
pro vyhledávání: '"Khadiev A"'
Autor:
Khadiev, Kamil, Serov, Danil
Let us consider the Multiple String Matching Problem. In this problem, we consider a long string, denoted by $t$, of length $n$. This string is referred to as a text. We also consider a sequence of $m$ strings, denoted by $S$, which we refer to as a
Externí odkaz:
http://arxiv.org/abs/2411.14850
Autor:
Khadiev, Kamil, Serov, Danil
Publikováno v:
LNCS, Vol. 14776, 2024
In this paper, we present a quantum property testing algorithm for recognizing a context-free language that is a concatenation of two palindromes $L_{REV}$. The query complexity of our algorithm is $O(\frac{1}{\varepsilon}n^{1/3}\log n)$, where $n$ i
Externí odkaz:
http://arxiv.org/abs/2406.11270
Autor:
Khadiev, Kamil, Yagafarov, Maxim
Publikováno v:
TAMC 2024, LNCS 14637
We consider online algorithms for the $k$-server problem on trees of size $n$. Chrobak and Larmore proposed a $k$-competitive algorithm for this problem that has the optimal competitive ratio. However, the existing implementations have $O\left(k^2 +
Externí odkaz:
http://arxiv.org/abs/2402.14633
Autor:
Khadiev, Kamil, Krendeleva, Elizaveta
Publikováno v:
In: Russian Microelectronics, 2023, Volume 52, pages S379-S383
In the paper, we investigate Two Sets Intersection problem. Assume that we have two sets that are subsets of n objects. Sets are presented by two predicates that show which of n objects belong to these sets. We present a quantum algorithm that finds
Externí odkaz:
http://arxiv.org/abs/2312.16897
In this paper, we present an efficient quantum compression method for identically prepared states with arbitrary dimentional.
Externí odkaz:
http://arxiv.org/abs/2307.12024
Autor:
Lapkin, Dmitry, Singh, Shweta, Kirner, Felizitas, Sturm, Sebastian, Assalauova, Dameli, Ignatenko, Alexandr, Wiek, Thomas, Gemming, Thomas, Lubk, Axel, Müller-Caspary, Knut, Khadiev, Azat, Novikov, Dmitri, Sturm, Elena V., Vartanyants, Ivan A.
The self-assembly of anisotropic nanocrystals (stabilized by organic capping molecules) with pre-selected composition, size, and shape allows for the creation of nanostructured materials with unique structures and features. For such a material, the s
Externí odkaz:
http://arxiv.org/abs/2306.14507
Publikováno v:
In: Qunatum Information & Computation, Vol.24, 2024,pp0267-0294
In this paper, we consider two versions of the Text Assembling problem. We are given a sequence of strings $s^1,\dots,s^n$ of total length $L$ that is a dictionary, and a string $t$ of length $m$ that is texts. The first version of the problem is ass
Externí odkaz:
http://arxiv.org/abs/2306.10572
Autor:
Khadiev, Kamil
The lecture notes contain three parts. The first part is Grover's Search Algorithm with modifications, generalizations, and applications. The second part is a discussion on the quantum fingerprinting technique. The third part is Quantum Walks (discre
Externí odkaz:
http://arxiv.org/abs/2212.14205
Autor:
Khadiev, Kamil, Safina, Liliya
In this paper, we present a quantum algorithm for the dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known determini
Externí odkaz:
http://arxiv.org/abs/2212.14433
The paper presents a technique for constructing noisy data structures called a walking tree. We apply it for a Red-Black tree (an implementation of a Self-Balanced Binary Search Tree) and a segment tree. We obtain the same complexity of the main oper
Externí odkaz:
http://arxiv.org/abs/2210.11197