BibTeX Export for Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs

Copy to Clipboard Download

@InProceedings{bhattacharyya_et_al:LIPIcs.CCC.2016.12,
  author =	{Bhattacharyya, Arnab and Gopi, Sivakanth},
  title =	{{Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs}},
  booktitle =	{31st Conference on Computational Complexity (CCC 2016)},
  pages =	{12:1--12:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-008-8},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{50},
  editor =	{Raz, Ran},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.12},
  URN =		{urn:nbn:de:0030-drops-58400},
  doi =		{10.4230/LIPIcs.CCC.2016.12},
  annote =	{Keywords: Locally correctable code, Locally testable code, Affine Invariance, Gowers uniformity norm}
}

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