Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
How to think about algorithms / / Jeff Edmonds [[electronic resource]]
| How to think about algorithms / / Jeff Edmonds [[electronic resource]] |
| Autore | Edmonds Jeff <1963-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2008 |
| Descrizione fisica | 1 online resource (xiii, 448 pages) : digital, PDF file(s) |
| Disciplina | 518/.1 |
| Soggetto topico |
Algorithms - Study and teaching
Loops (Group theory) - Study and teaching Invariants - Study and teaching Recursion theory - Study and teaching |
| ISBN |
1-107-17584-4
0-511-64579-1 9786612390289 1-282-39028-7 1-139-63726-6 0-511-80824-0 0-511-64988-6 0-511-41278-9 0-511-56800-2 0-511-41370-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Iterative algorithms: measures of progress and loop invariants -- Examples using more-of-the-input loop invariants -- Abstract data types -- Narrowing the search space: binary search -- Iterative sorting algorithms -- Euclid's GCD algorithm -- The loop invariant for lower bounds -- Abstractions, techniques, and theory -- Some simple examples of recursive algorithms -- Recursion on trees -- Recursive images -- Parsing with context-free grammars -- Definition of optimization problems -- Graph search algorithms -- Network flows and linear programming -- Greedy algorithms -- Recursive backtracking -- Dynamic programming algorithms -- Examples of dynamic programs -- Reductions and NP-completeness -- Randomized algorithms -- Existential and universal quantifiers -- Time complexity -- Logarithms and exponentials -- Asymptotic growth -- Adding-made-easy approximations -- Recurrence relations -- A formal proof of correctness. |
| Record Nr. | UNINA-9910454516203321 |
Edmonds Jeff <1963->
|
||
| Cambridge : , : Cambridge University Press, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
How to think about algorithms / / Jeff Edmonds [[electronic resource]]
| How to think about algorithms / / Jeff Edmonds [[electronic resource]] |
| Autore | Edmonds Jeff <1963-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2008 |
| Descrizione fisica | 1 online resource (xiii, 448 pages) : digital, PDF file(s) |
| Disciplina | 518/.1 |
| Soggetto topico |
Algorithms - Study and teaching
Loops (Group theory) - Study and teaching Invariants - Study and teaching Recursion theory - Study and teaching |
| ISBN |
1-107-17584-4
0-511-64579-1 9786612390289 1-282-39028-7 1-139-63726-6 0-511-80824-0 0-511-64988-6 0-511-41278-9 0-511-56800-2 0-511-41370-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Iterative algorithms: measures of progress and loop invariants -- Examples using more-of-the-input loop invariants -- Abstract data types -- Narrowing the search space: binary search -- Iterative sorting algorithms -- Euclid's GCD algorithm -- The loop invariant for lower bounds -- Abstractions, techniques, and theory -- Some simple examples of recursive algorithms -- Recursion on trees -- Recursive images -- Parsing with context-free grammars -- Definition of optimization problems -- Graph search algorithms -- Network flows and linear programming -- Greedy algorithms -- Recursive backtracking -- Dynamic programming algorithms -- Examples of dynamic programs -- Reductions and NP-completeness -- Randomized algorithms -- Existential and universal quantifiers -- Time complexity -- Logarithms and exponentials -- Asymptotic growth -- Adding-made-easy approximations -- Recurrence relations -- A formal proof of correctness. |
| Record Nr. | UNINA-9910782417503321 |
|
Edmonds Jeff <1963->
|
||
| Cambridge : , : Cambridge University Press, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||