We study algorithms for solving the problem of assembling a text (long string) from a dictionary (a sequence of small strings). The problem has an application in bioinformatics and has a connection with the sequence assembly ...

In the work, we focus on the complexity of the generic of a decision tree classifier constructing algorithm. The decision tree is constructed in ((running time in the classical case, where is a class numbers, is the input ...

We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las-Vegas unitary and ...

In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of representation of the k-OBDD computation process as an "automata-communication protocol" computation process. Our method ...

© 2018, Pleiades Publishing, Ltd. We introduce a new type of nonuniform two-way automaton that can use a different transition function for each tape square. We also enhance this model by allowing to shuffle the given input ...

© Published under licence by IOP Publishing Ltd. Energy field plays an important role in commercial world and makes a vital part of humanity. The paper considers the prediction problem concerning spent electrical energy ...

© 2020 The author(s). This is a review of quantum methods for machine learning problems that consists of two parts. The first part, "quantum tools", presented some of the fundamentals and introduced several quantum tools ...

© 2018, Pleiades Publishing, Ltd. Finding a marked vertex in a graph can be a complicated task when using quantum walks. Recent results show that for two or more adjacent marked vertices search by quantum walk with Grover’s ...

We consider the recognition problem of the Dyck Language generalized for multiple types of brackets. We provide an algorithm with quantum query complexity O(n(logn)0.5k), where n is the length of input and k is the maximal ...

© 2019, Springer Nature Switzerland AG. 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 ...