Complexity lower bounds for computation trees with elementary transcendental function gates

D. Grigoriev; N. Vorobjov

doi:10.1109/SFCS.1994.365736

Previous
Next
Table of Contents
Related Articles

Proceedings 35th Annual Symposium on Foundations of Computer Science

Complexity lower bounds for computation trees with elementary transcendental function gates

Year: 1994, Pages: 548-552

DOI Bookmark: 10.1109/SFCS.1994.365736

Authors

D. Grigoriev, Dept. of Comput. Sci.&Math., Pennsylvania State Univ., University Park, PA, USA
N. Vorobjov, Dept. of Comput. Sci.&Math., Pennsylvania State Univ., University Park, PA, USA

Complexity lower bounds for computation trees with elementary transcendental function gates

Authors

Abstract