Complexity lower bounds for computation trees with elementary transcendental function gates

Author: Grigoriev D.   Vorobjov N.  

Publisher: Elsevier

ISSN: 0304-3975

Source: Theoretical Computer Science, Vol.157, Iss.2, 1996-05, pp. : 185-214

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract