Two-way quantum and classical automata with advice for online minimization problems

dc.contributor.author	Khadiev K.
dc.contributor.author	Khadieva A.
dc.date.accessioned	2021-02-25T06:50:59Z
dc.date.available	2021-02-25T06:50:59Z
dc.date.issued	2020
dc.identifier.issn	0302-9743
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/161075
dc.description.abstract	© Springer Nature Switzerland AG 2020. We consider online algorithms. Typically the model is investigated with respect to competitive ratio. In this paper, we explore two-way automata as a model for online algorithms. We focus on quantum and classical online algorithms. We show that there are problems that can be solved more efficiently by two-way automata with quantum and classical states than classical two-way automata in the case of sublogarithmic memory (sublinear size) even if classical automata get advice bits.
dc.relation.ispartofseries	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.subject	Automata
dc.subject	Online algorithms
dc.subject	Online minimization problems
dc.subject	Quantum computation
dc.subject	Streaming algorithms
dc.subject	Two-way automata
dc.title	Two-way quantum and classical automata with advice for online minimization problems
dc.type	Conference Paper
dc.relation.ispartofseries-volume	12233 LNCS
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	428
dc.source.id	SCOPUS03029743-2020-12233-SID85089722241

Files in this item

Size: 98.92Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.