BibTeX record conf/coco/BogdanovT04

download as .bib file

@inproceedings{DBLP:conf/coco/BogdanovT04,
  author       = {Andrej Bogdanov and
                  Luca Trevisan},
  title        = {Lower Bounds for Testing Bipartiteness in Dense Graphs},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {75--81},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313803},
  doi          = {10.1109/CCC.2004.1313803},
  timestamp    = {Fri, 24 Mar 2023 00:04:21 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BogdanovT04.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.