k-forrelation optimally separates Quantum and classical query complexity. Bansal, N. & Sinha, M. In Khuller, S. & Williams, V. V., editors, STOC, pages 1303-1316, 2021. ACM.
Link
Paper bibtex @inproceedings{conf/stoc/BansalS21,
added-at = {2025-01-19T00:00:00.000+0100},
author = {Bansal, Nikhil and Sinha, Makrand},
biburl = {https://www.bibsonomy.org/bibtex/227c4e1695e8d97e9a0916018d77458ce/dblp},
booktitle = {STOC},
crossref = {conf/stoc/2021},
editor = {Khuller, Samir and Williams, Virginia Vassilevska},
ee = {https://www.wikidata.org/entity/Q130912987},
interhash = {cdd578c8407d1512d240bec635b3cfaa},
intrahash = {27c4e1695e8d97e9a0916018d77458ce},
isbn = {978-1-4503-8053-9},
keywords = {dblp},
pages = {1303-1316},
publisher = {ACM},
timestamp = {2025-01-27T10:49:35.000+0100},
title = {k-forrelation optimally separates Quantum and classical query complexity.},
url = {http://dblp.uni-trier.de/db/conf/stoc/stoc2021.html#BansalS21},
year = 2021
}
Downloads: 0
{"_id":"k6MabNue4vFTD7xfM","bibbaseid":"bansal-sinha-kforrelationoptimallyseparatesquantumandclassicalquerycomplexity-2021","author_short":["Bansal, N.","Sinha, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2025-01-19T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Bansal"],"firstnames":["Nikhil"],"suffixes":[]},{"propositions":[],"lastnames":["Sinha"],"firstnames":["Makrand"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/227c4e1695e8d97e9a0916018d77458ce/dblp","booktitle":"STOC","crossref":"conf/stoc/2021","editor":[{"propositions":[],"lastnames":["Khuller"],"firstnames":["Samir"],"suffixes":[]},{"propositions":[],"lastnames":["Williams"],"firstnames":["Virginia","Vassilevska"],"suffixes":[]}],"ee":"https://www.wikidata.org/entity/Q130912987","interhash":"cdd578c8407d1512d240bec635b3cfaa","intrahash":"27c4e1695e8d97e9a0916018d77458ce","isbn":"978-1-4503-8053-9","keywords":"dblp","pages":"1303-1316","publisher":"ACM","timestamp":"2025-01-27T10:49:35.000+0100","title":"k-forrelation optimally separates Quantum and classical query complexity.","url":"http://dblp.uni-trier.de/db/conf/stoc/stoc2021.html#BansalS21","year":"2021","bibtex":"@inproceedings{conf/stoc/BansalS21,\n added-at = {2025-01-19T00:00:00.000+0100},\n author = {Bansal, Nikhil and Sinha, Makrand},\n biburl = {https://www.bibsonomy.org/bibtex/227c4e1695e8d97e9a0916018d77458ce/dblp},\n booktitle = {STOC},\n crossref = {conf/stoc/2021},\n editor = {Khuller, Samir and Williams, Virginia Vassilevska},\n ee = {https://www.wikidata.org/entity/Q130912987},\n interhash = {cdd578c8407d1512d240bec635b3cfaa},\n intrahash = {27c4e1695e8d97e9a0916018d77458ce},\n isbn = {978-1-4503-8053-9},\n keywords = {dblp},\n pages = {1303-1316},\n publisher = {ACM},\n timestamp = {2025-01-27T10:49:35.000+0100},\n title = {k-forrelation optimally separates Quantum and classical query complexity.},\n url = {http://dblp.uni-trier.de/db/conf/stoc/stoc2021.html#BansalS21},\n year = 2021\n}\n\n","author_short":["Bansal, N.","Sinha, M."],"editor_short":["Khuller, S.","Williams, V. V."],"key":"conf/stoc/BansalS21","id":"conf/stoc/BansalS21","bibbaseid":"bansal-sinha-kforrelationoptimallyseparatesquantumandclassicalquerycomplexity-2021","role":"author","urls":{"Link":"https://www.wikidata.org/entity/Q130912987","Paper":"http://dblp.uni-trier.de/db/conf/stoc/stoc2021.html#BansalS21"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/Bansal?items=1000","dataSources":["QPenDByDoYqTm9vaT"],"keywords":["dblp"],"search_terms":["forrelation","optimally","separates","quantum","classical","query","complexity","bansal","sinha"],"title":"k-forrelation optimally separates Quantum and classical query complexity.","year":2021}