Selected papers that cite this one
- Dima Grigoriev. Nearly sharp complexity bounds for multiprocessor algebraic computations. Journal of Complexity, 13(1):50-64, March 1997.
- D. Grigoriev and N. Vorobjov. Complexity lower bounds for computation trees with elementary transcendental function gates. Theoretical Computer Science, 157(2):185-214, 5 May 1996.