![]() |
@article{DBLP:journals/tcs/GrigorievV96,
author = {Dima Grigoriev and
Nicolai Vorobjov},
title = {Complexity Lower Bounds for Computation Trees with Elementary
Transcendental Function Gates},
journal = {Theor. Comput. Sci.},
volume = {157},
number = {2},
year = {1996},
pages = {185-214},
ee = {http://dx.doi.org/10.1016/0304-3975(95)00159-X},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2003-11-19 by Michael Ley (ley@uni-trier.de)