Dima Grigoriev, Nicolai Vorobjov. Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. In 35th Annual Symposium on Foundations of Computer Science, 20-22 November 1994, Santa Fe, New Mexico, USA. pages 548-552, IEEE, 1994.
@inproceedings{GrigorievV94, title = {Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates}, author = {Dima Grigoriev and Nicolai Vorobjov}, year = {1994}, researchr = {https://researchr.org/publication/GrigorievV94}, cites = {0}, citedby = {0}, pages = {548-552}, booktitle = {35th Annual Symposium on Foundations of Computer Science, 20-22 November 1994, Santa Fe, New Mexico, USA}, publisher = {IEEE}, }