On the quantum and classical complexity of solving subtraction games

Dmitrijs Kravčenko; Kamil Khadiev; Danil Serov

doi:10.1007/978-3-030-19955-5_20

On the quantum and classical complexity of solving subtraction games

Dmitrijs Kravčenko
, Kamil Khadiev
, Danil Serov

Latvijas Universitāte

Kazan Volga Region Federal University

Pētījuma izpildes rezultāts: Nodaļa grāmatā/enciklopēdijā/konferences krājumā › Konferences zinātniskais raksts › Pētniecība › koleģiāli recenzēts

13 Atsauces (Scopus)

Oriģinālvaloda	Angļu
Rīkotāja publikācijas nosaukums	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publikācijas vieta	Cham
Izdevējs	Springer Nature
Lapas	228-236
Sējums	11532 LNCS
ISBN (Drukātā versija)	9783030199548
DOIs	https://doi.org/10.1007/978-3-030-19955-5_20
Publikācijas statuss	Publicēts - 2019

Publikāciju sērijas

Nosaukums	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 11532

Piekļuve Dokumentiem

10.1007/978-3-030-19955-5_20

Citi faili un saites

https://link.springer.com/chapter/10.1007%252F978-3-030-19955-5_20

Citēt šo

Kravčenko, D., Khadiev, K., & Serov, D. (2019). On the quantum and classical complexity of solving subtraction games. (gadā) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Sēj. 11532 LNCS, lpp. 228-236). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 11532). Springer Nature. https://doi.org/10.1007/978-3-030-19955-5_20

Kravčenko, Dmitrijs ; Khadiev, Kamil ; Serov, Danil. / On the quantum and classical complexity of solving subtraction games. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Sēj. 11532 LNCS Cham : Springer Nature, 2019. lpp. 228-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 11532).

@inproceedings{9c3cdfba8a874928943c3d9c208d3893,

title = "On the quantum and classical complexity of solving subtraction games",

author = "Dmitrijs Krav{\v c}enko and Kamil Khadiev and Danil Serov",

year = "2019",

doi = "10.1007/978-3-030-19955-5\_20",

language = "English",

isbn = "9783030199548",

volume = "11532 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 11532",

publisher = "Springer Nature",

pages = "228--236",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Kravčenko, D, Khadiev, K & Serov, D 2019, On the quantum and classical complexity of solving subtraction games. (kur) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). sēj. 11532 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 11532, Springer Nature, Cham, lpp. 228-236. https://doi.org/10.1007/978-3-030-19955-5_20

On the quantum and classical complexity of solving subtraction games. / Kravčenko, Dmitrijs; Khadiev, Kamil; Serov, Danil.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Sēj. 11532 LNCS Cham: Springer Nature, 2019. lpp. 228-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 11532).

Pētījuma izpildes rezultāts: Nodaļa grāmatā/enciklopēdijā/konferences krājumā › Konferences zinātniskais raksts › Pētniecība › koleģiāli recenzēts

TY - GEN

T1 - On the quantum and classical complexity of solving subtraction games

AU - Kravčenko, Dmitrijs

AU - Khadiev, Kamil

AU - Serov, Danil

PY - 2019

Y1 - 2019

UR - https://link.springer.com/chapter/10.1007%252F978-3-030-19955-5_20

U2 - 10.1007/978-3-030-19955-5_20

DO - 10.1007/978-3-030-19955-5_20

M3 - Conference paper

SN - 9783030199548

VL - 11532 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 11532

SP - 228

EP - 236

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Nature

CY - Cham

ER -

Kravčenko D, Khadiev K, Serov D. On the quantum and classical complexity of solving subtraction games. (gadā) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Sēj. 11532 LNCS. Cham: Springer Nature. 2019. lpp. 228-236. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 11532). doi: 10.1007/978-3-030-19955-5_20