Check out my first novel, midnight's simulacra!
Computer science eponyms: Difference between revisions
From dankwiki
No edit summary |
No edit summary |
||
| Line 16: | Line 16: | ||
* Amdahl's Law | * Amdahl's Law | ||
* Andersen's Algorithm | * Andersen's Algorithm | ||
* '''Armstrong's axioms''' are a set of inference rules which generate all functional dependencies of a relational database. Similarly, an '''Armstrong relation''' satisfies all the functional dependencies in the closure F<sup>+</sup> (and only those dependencies). | |||
* Backus-Naur Form | * Backus-Naur Form | ||
