Computer science eponyms: Difference between revisions
No edit summary |
No edit summary |
||
| Line 54: | Line 54: | ||
* Boyer-Moore Algorithm | * Boyer-Moore Algorithm | ||
* Bremermann's Limit | * Bremermann's Limit | ||
* Brent's Adder | * '''Brent's Adder''' is logn + O(log1/2n) depth and O(nlg n) size | ||
* '''Brent's Algorithm''' detects cycles using two pointers, and finds the length of the cycle directly | * '''Brent's Algorithm''' detects cycles using two pointers, and finds the length of the cycle directly | ||
* '''Brent's Method''' is a hybrid root-finding algorithm combining bisection, the secant method, and inverse quadratic interpolation | * '''Brent's Method''' is a hybrid root-finding algorithm combining bisection, the secant method, and inverse quadratic interpolation | ||