Year: 2022
Type: article
Abstract: We consider online algorithms with respect to the competitive ratio. In this paper, we explore one-way automata as a model for online algorithms. We focus on quantum and classical online algorithms. For a specially constructed online minimization problem, we provide a quantum log-bounded automaton that is more effective (has less competitive ratio) than classical automata, even with advice, in the case of the logarithmic size of memory. We construct an online version of the well-known Disjointness problem as a problem. It was investigated by many researchers from a communication complexity and query complexity point of view.
Source: Mathematics
DOI: 10.3390/math10010143
Authors: Kamil Khadiev, Aliya Khadieva
Institutions: Kazan Federal University, University of Latvia
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,885
Awards: G1709152956, G5975831255
OpenAlex ID: W4205755886