dankwiki

Computer science eponyms: Difference between revisions

← Older editNewer edit →

Dank (talk | contribs)

2 user groups
11,328 edits
No edit summary
No edit summary
Line 140: Line 140:
* Fredkin gate
* Fredkin gate
* Friedberg-Muchnik Theorem
* Friedberg-Muchnik Theorem
* Fruchterman-Reingold heuristic
* '''Fürer's algorithm''' multiplies two ''n''-digit numbers in ''O(nlgn*2<sup>O(lg*n)</sup>)''
* '''Fürer's algorithm''' multiplies two ''n''-digit numbers in ''O(nlgn*2<sup>O(lg*n)</sup>)''


Retrieved from "https://nick-black.com/dankwiki/index.php?title=Computer_science_eponyms"