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

University of Latvia

Kazan Volga Region Federal University

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

13 Citations (Scopus)

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Place of Publication	Cham
Publisher	Springer Nature
Pages	228-236
Volume	11532 LNCS
ISBN (Print)	9783030199548
DOIs	https://doi.org/10.1007/978-3-030-19955-5_20
Publication status	Published - 2019

Publication series

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

OECD Field of Science

1.2 Computer and Information Sciences

Access to Document

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

Cite this

Kravčenko, D., Khadiev, K., & Serov, D. (2019). On the quantum and classical complexity of solving subtraction games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11532 LNCS, pp. 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). Vol. 11532 LNCS Cham : Springer Nature, 2019. pp. 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. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 11532 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 11532, Springer Nature, Cham, pp. 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). Vol. 11532 LNCS Cham: Springer Nature, 2019. p. 228-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 11532).

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

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. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 11532 LNCS. Cham: Springer Nature. 2019. p. 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

On the quantum and classical complexity of solving subtraction games

Publication series

OECD Field of Science

Access to Document

Other files and links

Cite this