Kazan Federal University Digital Repository

Two-way quantum and classical machines with small memory for online minimization problems

Show simple item record

dc.contributor.author Khadiev K.
dc.contributor.author Khadieva A.
dc.date.accessioned 2020-01-15T21:17:42Z
dc.date.available 2020-01-15T21:17:42Z
dc.date.issued 2019
dc.identifier.issn 0277-786X
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/155579
dc.description.abstract © 2019 SPIE. We consider online algorithms. Typically the model is investigated with respect to competitive ratio. In this paper, we explore algorithms with small memory. We investigate two-way automata as a model for online algorithms with restricted memory. We focus on quantum and classical online algorithms. We show that there are problems that can be better solved by two-way automata with quantum and classical states than classical two-way automata in the case of sublogarithmic memory (sublinear size).
dc.relation.ispartofseries Proceedings of SPIE - The International Society for Optical Engineering
dc.subject automata
dc.subject computational complexity
dc.subject OBDD
dc.subject online algorithms
dc.subject online minimization problems
dc.subject quantum computation
dc.subject two-way automata
dc.title Two-way quantum and classical machines with small memory for online minimization problems
dc.type Conference Paper
dc.relation.ispartofseries-volume 11022
dc.collection Публикации сотрудников КФУ
dc.source.id SCOPUS0277786X-2019-11022-SID85063526287


Files in this item

This item appears in the following Collection(s)

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

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics