BibTeX record conf/coco/BuhrmanW01

download as .bib file

@inproceedings{DBLP:conf/coco/BuhrmanW01,
  author       = {Harry Buhrman and
                  Ronald de Wolf},
  title        = {Communication Complexity Lower Bounds by Polynomials},
  booktitle    = {Proceedings of the 16th Annual {IEEE} Conference on Computational
                  Complexity, Chicago, Illinois, USA, June 18-21, 2001},
  pages        = {120--130},
  publisher    = {{IEEE} Computer Society},
  year         = {2001},
  url          = {https://doi.org/10.1109/CCC.2001.933879},
  doi          = {10.1109/CCC.2001.933879},
  timestamp    = {Fri, 24 Mar 2023 00:04:21 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BuhrmanW01.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.