|
|
|
|
| LEADER |
01220cam a22003977a 4500 |
| 001 |
BIBLO-36285 |
| 003 |
AR-BaUEN |
| 005 |
20241106150445.0 |
| 008 |
050426s1996 xxu||||f |||| 00| 0|eng|d |
| 040 |
|
|
|a AR-BaUEN
|b spa
|c AR-BaUEN
|
| 020 |
|
|
|a 0133350681
|
| 044 |
|
|
|a xxu
|
| 080 |
|
|
|a 681.391
|
| 100 |
1 |
|
|a Brassard, Gilles
|
| 245 |
1 |
0 |
|a Fundamentals of algorithmics
|
| 260 |
|
|
|a Upper Saddle River, NJ :
|b Prentice Hall,
|c 1996
|
| 300 |
|
|
|a xix, 524 p.
|
| 505 |
0 |
0 |
|t PREFACE
|
| 505 |
0 |
0 |
|g 1
|t PRELIMINARIES
|
| 505 |
0 |
0 |
|g 2
|t ELEMENTARY ALGORITHMICS
|
| 505 |
0 |
0 |
|g 3
|t ASYMPTOTIC NOTATION
|
| 505 |
0 |
0 |
|g 4
|t ANALYSIS OF ALGORITHMS
|
| 505 |
0 |
0 |
|g 5
|t SOME DATA STRUCTURES
|
| 505 |
0 |
0 |
|g 6
|t GREEDY ALGORITHMS
|
| 505 |
0 |
0 |
|g 7
|t DIVIDE-AND-CONQUER
|
| 505 |
0 |
0 |
|g 8
|t DYNAMIC PROGRAMMING
|
| 505 |
0 |
0 |
|g 9
|t EXPLORING GRAPHS
|
| 505 |
0 |
0 |
|g 10
|t PROBABILISTIC ALGORITHMS
|
| 505 |
0 |
0 |
|g 11
|t PARALLEL ALGORITHMS
|
| 505 |
0 |
0 |
|g 12
|t COMPUTATIONAL COMPLEXITY
|
| 505 |
0 |
0 |
|g 13
|t HEURISTIC AND APPROXIMATE ALGORITHMS
|
| 505 |
0 |
0 |
|t REFERENCES
|
| 505 |
0 |
0 |
|t INDEX
|
| 650 |
1 |
7 |
|2 spines
|a ALGORITMOS
|
| 700 |
1 |
|
|a Bratley, Paul
|
| 962 |
|
|
|a info:eu-repo/semantics/book
|a info:ar-repo/semantics/libro
|b info:eu-repo/semantics/publishedVersion
|