On the quantum and classical complexity of solving subtraction games

DOI10.1007/978-3-030-19955-5_20OpenAlexW2952143095MaRDI QIDQ2330562

Danil Serov, Dmitry Kravchenko, Kamil Khadiev

Publication date: 22 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-19955-5_20

zbMATH Keywords

game theoryquantum computationquantum algorithmNimquery modelquantum modelssubtraction game

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (5)

Quantum algorithm for Dyck language with multiple types of brackets ⋮ Quantum algorithm for dynamic programming approach for DAGs and applications ⋮ An exact quantum algorithm for a restricted subtraction game ⋮ Classical and quantum algorithms for constructing text from dictionary problem ⋮ Classical and Quantum Algorithms for Assembling a Text from a Dictionary

This page was built for publication: On the quantum and classical complexity of solving subtraction games