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

We consider online algorithms. Typically, the model is investigated with respect to the competitive ratio. In this paper, we explore two-way automata and one-way automata as models for online algorithms. We focus on quantum and classical online algorithms. We show that there are problems that can be...

Celý popis

Podrobná bibliografie

Vydáno v:	Theoretical computer science Ročník 920; s. 76 - 94
Hlavní autoři:	Khadiev, Kamil, Khadieva, Aliya, Ziatdinov, Mansur, Mannapov, Ilnaz, Kravchenko, Dmitry, Rivosh, Alexander, Yamilov, Ramis
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 12.06.2022
Témata:	Automata Online algorithms Online minimization problems Quantum computation Streaming algorithms Two-way automata Two-way automata Online algorithms Streaming algorithms Quantum computation Online minimization problems Automata
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!