Computer science eponyms: Difference between revisions
No edit summary |
No edit summary |
||
| Line 141: | Line 141: | ||
* '''Fagin's Theorem''' states that the set of all properties expressible in existential second-order logic is precisely the complexity class NP | * '''Fagin's Theorem''' states that the set of all properties expressible in existential second-order logic is precisely the complexity class NP | ||
* '''Falk diagrams''' graph various performance counters against time (typically expressed in cycles) | |||
* Faugère F5 algorithm | * Faugère F5 algorithm | ||
* Fenwick trees | * Fenwick trees | ||