BibTeX record journals/mst/ArvindKM96

download as .bib file

@article{DBLP:journals/mst/ArvindKM96,
  author       = {Vikraman Arvind and
                  Johannes K{\"{o}}bler and
                  Martin Mundhenk},
  title        = {Upper Bounds for the Complexity of Sparse and Tally Descriptions},
  journal      = {Math. Syst. Theory},
  volume       = {29},
  number       = {1},
  pages        = {63--94},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01201814},
  doi          = {10.1007/BF01201814},
  timestamp    = {Sun, 17 May 2020 11:44:56 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/ArvindKM96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.