Computer science eponyms: Difference between revisions
No edit summary |
No edit summary |
||
| Line 17: | Line 17: | ||
* Amdahl's Law | * Amdahl's Law | ||
* Andersen's Algorithm | * Andersen's Algorithm | ||
* the '''Anderson–Björck Algorithm''' improves on the Illinois Algorithm, which is itself an improvement on the ''regula falsi'' method of solving for roots. | |||
* Angluin's algorithm | * Angluin's algorithm | ||
* '''Arikan's PAC Codes''' aka polarization-adjusted convolutional [https://en.wikipedia.org/wiki/Polar_code_(coding_theory) polar coding] outperform CRC-aided and purely convolutional polar codes, approaching the theoretical channel capacity for short blocklengths. | * '''Arikan's PAC Codes''' aka polarization-adjusted convolutional [https://en.wikipedia.org/wiki/Polar_code_(coding_theory) polar coding] outperform CRC-aided and purely convolutional polar codes, approaching the theoretical channel capacity for short blocklengths. | ||