BibTeX record journals/tcs/HromkovicPS09

download as .bib file

@article{DBLP:journals/tcs/HromkovicPS09,
  author       = {Juraj Hromkovic and
                  Holger Petersen and
                  Georg Schnitger},
  title        = {On the limits of the communication complexity technique for proving
                  lower bounds on the size of minimal NFA's},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {30-32},
  pages        = {2972--2981},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.tcs.2009.03.020},
  doi          = {10.1016/J.TCS.2009.03.020},
  timestamp    = {Wed, 17 Feb 2021 22:00:40 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HromkovicPS09.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.