<--- Back to Details
First PageDocument Content
Logarithms / Common logarithm / Natural logarithm / Logarithm / E / Inverse hyperbolic function / Floating point / Binary logarithm
Date: 2006-08-31 14:33:57
Logarithms
Common logarithm
Natural logarithm
Logarithm
E
Inverse hyperbolic function
Floating point
Binary logarithm

a-2-ApproximatingWithLogs.nb

Add to Reading List

Source URL: quantum.bu.edu

Download Document from Source Website

File Size: 57,36 KB

Share Document on Facebook

Similar Documents

Mathematics / Mathematical analysis / Special functions / Logarithms / Mathematical notation / Binary operations / Mental calculation / Common logarithm / Natural logarithm / Pi / Big O notation / Exponentiation

The Practical Use of the Bemer Method for Exponentials Update Version: September 5, 2006 Ron Doerfler (http://www.myreckonings.com) In Chapter 4 of my book, Dead Reckoning: Calculating Without Instruments, a method is gi

DocID: 1rrb5 - View Document

Abstract algebra / Algebra / Cryptography / Finite fields / Group theory / Logarithms / Computational hardness assumptions / Binary operations / Discrete logarithm / Elliptic curve cryptography / Prime number / Elliptic curve

Computing discrete logarithms in fields of small characteristic Francisco Rodr´ıguez-Henr´ıquez CINVESTAV-IPN Joint work with:

DocID: 1r2Hf - View Document

Mathematics / Binary operations / Elementary arithmetic / Subtraction / Addition / Surface tension / Logarithm

MarchBuilding Excitement and Success for Young Children Kessler Elementary School Ms. Debbie Morgan, Principal

DocID: 1r20j - View Document

Software / Application software / Mathematical software / Array programming languages / Binary operations / GNU Octave / Binary arithmetic / Octave / MATLAB / Binary logarithm / Division / Pitch class

Computing Fundamentals Salvatore Filippone 2013–2014

DocID: 1qnq6 - View Document

Sorting algorithms / Mathematics / Computer programming / Software engineering / Quicksort / Merge sort / Best /  worst and average case / Binary search algorithm / Recursion / Binary logarithm / Heapsort / Insertion sort

Analysis with parallel partition 11 —  We know a pack is O(n) work, O(log n) span ¡  Based

DocID: 1pN5b - View Document