Exponential-time quantum algorithms for graph coloring problems

DOI10.1007/978-3-030-61792-9_31OpenAlexW3117689762MaRDI QIDQ5918508

Kazuya Shimizu, Ryuhei Mori

Publication date: 13 October 2022

Published in: LATIN 2020: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.00529

zbMATH Keywords

dynamic programminggraph coloringquantum algorithmGrover's search

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Quantum complexity for vector domination problem

This page was built for publication: Exponential-time quantum algorithms for graph coloring problems