Quantum Complexity of Minimum Cut (bibtex)

by Simon Apers and Troy Lee

Reference:

Quantum Complexity of Minimum Cut (Simon Apers and Troy Lee), In 36th Computational Complexity Conference (Valentine Kabanets, ed.), Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, volume 200, 2021.

Bibtex Entry:

@inproceedings{DBLP:conf/coco/ApersL21,
	author = {Simon Apers and Troy Lee},
	biburl = {https://dblp.org/rec/conf/coco/ApersL21.bib},
	booktitle = {36th {C}omputational {C}omplexity {C}onference},
	category = {conference},
	date-added = {2024-09-05 10:48:37 +0200},
	date-modified = {2024-09-05 10:48:37 +0200},
	doi = {10.4230/LIPIcs.CCC.2021.28},
	editor = {Valentine Kabanets},
	keep = {true},
	note = {Équipe \kl{algocomp}},
	pages = {28:1--28:33},
	poles = {ASD},
	publisher = {Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern},
	series = {LIPIcs. Leibniz Int. Proc. Inform.},
	teams = {algocomp},
	title = {Quantum Complexity of Minimum Cut},
	url = {https://doi.org/10.4230/LIPIcs.CCC.2021.28},
	volume = {200},
	year = {2021},
	bdsk-url-1 = {https://doi.org/10.4230/LIPIcs.CCC.2021.28}}