Go to the corresponding LIPIcs Volume Portal 
Aaronson, Scott ; Chia, NaiHui ; Lin, HanHsuan ; Wang, Chunhao ; Zhang, Ruizhe
pdfformat: 

@InProceedings{aaronson_et_al:LIPIcs:2020:12568, author = {Scott Aaronson and NaiHui Chia and HanHsuan Lin and Chunhao Wang and Ruizhe Zhang}, title = {{On the Quantum Complexity of Closest Pair and Related Problems}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {16:116:43}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771566}, ISSN = {18688969}, year = {2020}, volume = {169}, editor = {Shubhangi Saraf}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12568}, URN = {urn:nbn:de:0030drops125681}, doi = {10.4230/LIPIcs.CCC.2020.16}, annote = {Keywords: Closest pair, Quantum computing, Quantum fine grained reduction, Quantum strong exponential time hypothesis, Fine grained complexity} }
Keywords:  Closest pair, Quantum computing, Quantum fine grained reduction, Quantum strong exponential time hypothesis, Fine grained complexity  
Collection:  35th Computational Complexity Conference (CCC 2020)  
Issue Date:  2020  
Date of publication:  17.07.2020 