BibTeX record conf/coco/ChouKS18

download as .bib file

@inproceedings{DBLP:conf/coco/ChouKS18,
  author    = {Chi{-}Ning Chou and
               Mrinal Kumar and
               Noam Solomon},
  title     = {Hardness vs Randomness for Bounded Depth Arithmetic Circuits},
  booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
               2018, San Diego, CA, {USA}},
  pages     = {13:1--13:17},
  year      = {2018},
  crossref  = {DBLP:conf/coco/2018},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2018.13},
  doi       = {10.4230/LIPIcs.CCC.2018.13},
  timestamp = {Thu, 23 Aug 2018 15:56:19 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/ChouKS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2018,
  editor    = {Rocco A. Servedio},
  title     = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
               2018, San Diego, CA, {USA}},
  series    = {LIPIcs},
  volume    = {102},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-069-9},
  isbn      = {978-3-95977-069-9},
  timestamp = {Mon, 04 Jun 2018 18:10:04 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier