BibTeX record conf/coco/AmbainisB23

download as .bib file

@inproceedings{DBLP:conf/coco/AmbainisB23,
  author       = {Andris Ambainis and
                  Aleksandrs Belovs},
  editor       = {Amnon Ta{-}Shma},
  title        = {An Exponential Separation Between Quantum Query Complexity and the
                  Polynomial Degree},
  booktitle    = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
                  2023, Warwick, {UK}},
  series       = {LIPIcs},
  volume       = {264},
  pages        = {24:1--24:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2023.24},
  doi          = {10.4230/LIPICS.CCC.2023.24},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/AmbainisB23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.