BibTeX record conf/coco/KaneR18

download as .bib file

@inproceedings{DBLP:conf/coco/KaneR18,
  author       = {Daniel Kane and
                  Sankeerth Rao},
  editor       = {Rocco A. Servedio},
  title        = {A {PRG} for Boolean {PTF} of Degree 2 with Seed Length Subpolynomial
                  in epsilon and Logarithmic in n},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {2:1--2:24},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.2},
  doi          = {10.4230/LIPICS.CCC.2018.2},
  timestamp    = {Tue, 09 Apr 2024 09:09:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/KaneR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.