BibTeX Export for Cumulative Memory Lower Bounds for Randomized and Quantum Computation

Copy to Clipboard Download

@InProceedings{beame_et_al:LIPIcs.ICALP.2023.17,
  author =	{Beame, Paul and Kornerup, Niels},
  title =	{{Cumulative Memory Lower Bounds for Randomized and Quantum Computation}},
  booktitle =	{50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
  pages =	{17:1--17:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-278-5},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{261},
  editor =	{Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.17},
  URN =		{urn:nbn:de:0030-drops-180694},
  doi =		{10.4230/LIPIcs.ICALP.2023.17},
  annote =	{Keywords: Cumulative memory complexity, time-space tradeoffs, branching programs, quantum lower bounds}
}

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