| Autore |
Cormen Thomas H
|
| Edizione | [1st ed.] |
| Pubbl/distr/stampa |
Cambridge, Mass., : MIT Press, 2013
|
| Descrizione fisica |
1 PDF (xiii, 222 pages) : illustrations
|
| Disciplina |
005.1
|
| Soggetto topico |
Computer algorithms
|
| ISBN |
9780262313230
0262313235
9781299284272
1299284272
9780262313223
0262313227
|
| Formato |
Materiale a stampa  |
| Livello bibliografico |
Monografia |
| Lingua di pubblicazione |
eng
|
| Nota di contenuto |
Intro -- Contents -- Preface -- 1 What Are Algorithms and Why Should You Care? -- Correctness -- Resource usage -- Computer algorithms for non-computer people -- Computer algorithms for computer people -- Further reading -- 2 How to Describe and Evaluate Computer Algorithms -- How to describe computer algorithms -- How to characterize running times -- Loop invariants -- Recursion -- Further reading -- 3 Algorithms for Sorting and Searching -- Binary search -- Selection sort -- Insertion sort -- Merge sort -- Quicksort -- Recap -- Further reading -- 4 A Lower Bound for Sorting and How to Beat It -- Rules for sorting -- The lower bound on comparison sorting -- Beating the lower bound with counting sort -- Radix sort -- Further reading -- 5 Directed Acyclic Graphs -- Directed acyclic graphs -- Topological sorting -- How to represent a directed graph -- Running time of topological sorting -- Critical path in a PERT chart -- Shortest path in a directed acyclic graph -- Further reading -- 6 Shortest Paths -- Dijkstra's algorithm -- The Bellman-Ford algorithm -- The Floyd-Warshall algorithm -- Further reading -- 7 Algorithms on Strings -- Longest common subsequence -- Transforming one string to another -- String matching -- Further reading -- 8 Foundations of Cryptography -- Simple substitution ciphers -- Symmetric-key cryptography -- Public-key cryptography -- The RSA cryptosystem -- Hybrid cryptosystems -- Computing random numbers -- Further reading -- 9 Data Compression -- Huffman codes -- Fax machines -- LZW compression -- Further reading -- 10 Hard? Problems -- Brown trucks -- The classes P and NP and NP-completeness -- Decision problems and reductions -- A Mother Problem -- A sampler of NP-complete problems -- General strategies -- Perspective -- Undecidable problems -- Wrap-up -- Further reading -- Bibliography -- Index.
|
| Record Nr. | UNINA-9910260622203321 |