When.com Web Search

Search results

1. Results From The WOW.Com Content Network

2. Pollard's rho algorithm for logarithms - Wikipedia

   en.wikipedia.org/wiki/Pollard's_rho_algorithm_for...

   Pollard's rho algorithm for logarithms is an algorithm introduced by John Pollard in 1978 to solve the discrete logarithm problem, ... 2 2 3 20 2 1 1000 3 3 4 100 2 2 ...

3. Pollard's kangaroo algorithm - Wikipedia

   en.wikipedia.org/wiki/Pollard's_kangaroo_algorithm

   The algorithm was introduced in 1978 by the number theorist John M. Pollard, in the same paper as his better-known Pollard's rho algorithm for solving the same problem. [1] [2] Although Pollard described the application of his algorithm to the discrete logarithm problem in the multiplicative group of units modulo a prime p, it is in fact a ...

4. Index calculus algorithm - Wikipedia

   en.wikipedia.org/wiki/Index_calculus_algorithm

   Finally, in an operation too simple to really be called a fourth stage, the results of the second and third stages can be rearranged by simple algebraic manipulation to work out the desired discrete logarithm x = f 0 log g (−1) + f 1 log g 2 + f 2 log g 3 + ··· + f r log g p r − s. The first and third stages are both embarrassingly ...

5. Logarithm - Wikipedia

   en.wikipedia.org/wiki/Logarithm

   The graph of the logarithm base 2 crosses the x-axis at x = 1 and passes through the points (2, 1), (4, 2), and (8, 3), depicting, e.g., log 2 (8) = 3 and 2 3 = 8. The graph gets arbitrarily close to the y-axis, but does not meet it. Addition, multiplication, and exponentiation are three of the most fundamental arithmetic operations.

6. Microsoft Math Solver - Wikipedia

   en.wikipedia.org/wiki/Microsoft_Math_Solver

   Microsoft Math contains features that are designed to assist in solving mathematics, science, and tech-related problems, as well as to educate the user. The application features such tools as a graphing calculator and a unit converter. It also includes a triangle solver and an equation solver that provides step-by-step solutions to each problem.

7. Computational complexity of mathematical operations - Wikipedia

   en.wikipedia.org/wiki/Computational_complexity...

   The elementary functions are constructed by composing arithmetic operations, the exponential function (), the natural logarithm (), trigonometric functions (,), and their inverses. The complexity of an elementary function is equivalent to that of its inverse, since all elementary functions are analytic and hence invertible by means of Newton's ...