Anonymous

Computer science eponyms: Difference between revisions

From dankwiki
no edit summary
No edit summary
No edit summary
Line 49: Line 49:
* Bremermann's Limit
* Bremermann's Limit
* Brent's Adder
* Brent's Adder
* Brent's Algorithm
* '''Brent's Algorithm''' detects cycles using two pointers, and finds the length of the cycle directly
* Brent's Theorem
* '''Brent's Method''' is a hybrid root-finding algorithm combining bisection, the secant method, and inverse quadratic interpolation
* '''Brent's Theorem''' aka '''Brent's Law''' states that p < N processors can simulate N in T_p ≤ T_N + (T_1 - T_N)/p
* Bresenham's Algorithm
* Bresenham's Algorithm
* Brewer's Theorem
* Brewer's Theorem
Line 290: Line 291:
* Pollaczek–Khinchine formula
* Pollaczek–Khinchine formula
* Pollard's Kangaroo Algorithm
* Pollard's Kangaroo Algorithm
* '''Pollard's ρ Algorithm''' aka '''Pollard's rho Algorithm''' factors integers in running time expected to be proportional to the square root of the smallest prime factor of the number being factored
* Popek-Goldberg virtualization requirements
* Popek-Goldberg virtualization requirements
* Post's correspondence problem
* Post's correspondence problem