Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Computation tree
open-in-new
<h2 id="references">References</h2> <ol> <li id="fn:1"><p>Griffor, E. R. (1999), Handbook of Computability Theory, Studies in Logic and the Foundations of Mathematics, vol. 140, Elsevier, p. 595, ISBN 9780080533049. <a href="9780080533049" target="_blank">9780080533049</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Moret, Bernard M. E. (1998), The Theory of Computation, Addison-Wesley, p. 338, ISBN 9780201258288. <a href="9780201258288" target="_blank">9780201258288</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Griffor, E. R. (1999), Handbook of Computability Theory, Studies in Logic and the Foundations of Mathematics, vol. 140, Elsevier, p. 595, ISBN 9780080533049. <a href="9780080533049" target="_blank">9780080533049</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Ben-Or, M. (1983), "Lower bounds for algebraic computation trees", Proc. 15th Annu. Symp. Theory of Computing, pp. 80–86, doi:10.1145/800061.808735. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Grigoriev, Dima; Vorobjov, Nicolai (1996), "Complexity lower bounds for computation trees with elementary transcendental function gates", Theor. Comput. Sci., 157 (2): 185–214, doi:10.1016/0304-3975(95)00159-X. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> </ol>