BibTeX record conf/mfcs/DemenkovK11

download as .bib file

@inproceedings{DBLP:conf/mfcs/DemenkovK11,
  author       = {Evgeny Demenkov and
                  Alexander S. Kulikov},
  editor       = {Filip Murlak and
                  Piotr Sankowski},
  title        = {An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity
                  of Affine Dispersers},
  booktitle    = {Mathematical Foundations of Computer Science 2011 - 36th International
                  Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6907},
  pages        = {256--265},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22993-0\_25},
  doi          = {10.1007/978-3-642-22993-0\_25},
  timestamp    = {Wed, 25 Sep 2019 18:21:36 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/DemenkovK11.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.