Quantum algorithms for graph problems with cut queries (bibtex)

by Troy Lee, Miklos Santha and Shengyu Zhang

Reference:

Quantum algorithms for graph problems with cut queries (Troy Lee, Miklos Santha and Shengyu Zhang), In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, 2021.

Bibtex Entry:

@inproceedings{Lee2021,
	author = {Troy Lee and Miklos Santha and Shengyu Zhang},
	booktitle = {Proceedings of the 2021 {ACM}-{SIAM} Symposium on Discrete Algorithms ({SODA})},
	date-added = {2021-03-05 17:26:50 +0100},
	date-modified = {2021-03-05 17:35:44 +0100},
	doi = {10.1137/1.9781611976465.59},
	month = jan,
	pages = {939--958},
	publisher = {Society for Industrial and Applied Mathematics},
	title = {Quantum algorithms for graph problems with cut queries},
	url = {https://doi.org/10.1137/1.9781611976465.59},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.1137/1.9781611976465.59}}