Computer science eponyms: Difference between revisions
No edit summary |
No edit summary |
||
| Line 94: | Line 94: | ||
* [https://en.wikipedia.org/wiki/Conway%27s_law Conway's Law] | * [https://en.wikipedia.org/wiki/Conway%27s_law Conway's Law] | ||
* Cook reduction | * Cook reduction | ||
* Cook-Levin Theorem | * the '''Cook-Levin Theorem''' (sometimes just '''Cook Theorem''') proves that the Boolean satisfiability problem is NP-complete. | ||
* Cooley-Tukey Algorithm | * the '''Cooley-Tukey Algorithm''' is the workhorse algorithm for Fast Fourier Transforms. | ||
* Coppersmith-Winograd Algorithm | * the '''Coppersmith-Winograd Algorithm''' multiplied matrices in the least time complexity from 1990-2010, and used the "laser method" employed by all improvements since. | ||
* Craig, Landin and Hagersten lock | * Craig, Landin and Hagersten lock | ||
* Cranfield method | * Cranfield method | ||