BibTeX record journals/tcs/GrigorievV96

download as .bib file

@article{DBLP:journals/tcs/GrigorievV96,
  author       = {Dima Grigoriev and
                  Nicolai N. Vorobjov Jr.},
  title        = {Complexity Lower Bounds for Computation Trees with Elementary Transcendental
                  Function Gates},
  journal      = {Theor. Comput. Sci.},
  volume       = {157},
  number       = {2},
  pages        = {185--214},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00159-X},
  doi          = {10.1016/0304-3975(95)00159-X},
  timestamp    = {Mon, 22 Feb 2021 08:50:19 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GrigorievV96.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.