BibTeX Export for Explicit relation between all lower bound techniques for quantum query complexity

Copy to Clipboard Download

@InProceedings{magnin_et_al:LIPIcs.STACS.2013.434,
  author =	{Magnin, Lo\"{i}ck and Roland, J\'{e}r\'{e}mie},
  title =	{{Explicit relation between all lower bound techniques for quantum query complexity}},
  booktitle =	{30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
  pages =	{434--445},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-50-7},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{20},
  editor =	{Portier, Natacha and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.434},
  URN =		{urn:nbn:de:0030-drops-39548},
  doi =		{10.4230/LIPIcs.STACS.2013.434},
  annote =	{Keywords: Quantum computation, lower bound, adversary method, polynomial method}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode