|
|
| |
| Authors | Herbert S. Wilf |
| Language | English |
| Type | public |
| Url | |
| Summary | Easy/hard problems, NP-completeness, Turing Machines,
Cook's theorem, SAT |
| Pages | 139 |
| Parts | Chapter 0: What This Book Is About
Chapter 1: Mathemattical Preliminaries
Chapter 2: Recursive Algorithms
Chapter 3: The Network Flow Problem
Chapter 4: Algorithms in the Theory of Numbers
Chapter 5: NP-completeness |
| |
| |
| Authors | Y. Lemaire |
| Language | Francais |
| Type | public |
| Url | |
| Summary | theorie, complexite, arbres, monoides, langages,
automates, caml |
| Pages | 114 |
| Parts | Preuve et evaluation d'un programme
Notions de base
Arbres
Automates Finis
Memento CAML |
| |
generated by OrgaDoc 0.8
|