BibTeX record conf/stoc/ChenOS17

download as .bib file

@inproceedings{DBLP:conf/stoc/ChenOS17,
  author       = {Xi Chen and
                  Igor C. Oliveira and
                  Rocco A. Servedio},
  editor       = {Hamed Hatami and
                  Pierre McKenzie and
                  Valerie King},
  title        = {Addition is exponentially harder than counting for shallow monotone
                  circuits},
  booktitle    = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages        = {1232--1245},
  publisher    = {{ACM}},
  year         = {2017},
  url          = {https://doi.org/10.1145/3055399.3055425},
  doi          = {10.1145/3055399.3055425},
  timestamp    = {Tue, 30 May 2023 10:25:06 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ChenOS17.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.