Complexity lower bounds for computation trees with elementary transcendental function gates

From MaRDI portal
Publication:1365876

DOI10.1016/0304-3975(95)00159-XzbMath0877.68086WikidataQ30048515 ScholiaQ30048515MaRDI QIDQ1365876

Nikolaj N. jun. Vorob'ev, Dima Yu. Grigoriev

Publication date: 9 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)




Related Items (8)



Cites Work


This page was built for publication: Complexity lower bounds for computation trees with elementary transcendental function gates