Quantum algorithms for graph problems with cut queries - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Troy Lee, Miklos Santha, Shengyu Zhang. Quantum algorithms for graph problems with cut queries. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 939-958, SIAM, 2022. [doi]

The following publications are possibly variants of this publication:

Quantum algorithms for graph problems with cut queriesTroy Lee, Miklos Santha, Shengyu Zhang. soda 2021: 939-958 [doi]

Improved Slime Mold Algorithm with Dynamic Quantum Rotation Gate and Opposition-Based Learning for Global Optimization and Engineering Design ProblemsYunyang Zhang, Shiyu Du, Quan Zhang. algorithms, 15(9):317, 2022. [doi]

runs on WebDSL