Double dabble computer science (1 risultati)

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. The followingtables list the running time of various algorithms for commonmathematical operations. Here, complexity refers to the time complexityof performing computations on a multitape Turing machine. See big Onotation for an explanation of the notation used.Note: Due to thevariety of multiplication algorithms, M(n) below stands in for thecomplexity of the chosen multiplication algorithm.The elementaryfunctions are constructed by composing arithmetic operations, theexponential function (exp), the natural logarithm (log), trigonometricfunctions (sin, cos), and their inverses. The complexity of anelementary function is equivalent to that of its inverse, since allelementary functions are analytic and hence invertible by means ofNewton's method. In particular, if either exp or log can be computedwith some complexity, then that complexity is attainable for all otherelementary functions.…