Textbook that teaches students how to think about algorithms like an expert, without getting bogged down in formal proof.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Jeff Edmonds received his Ph.D. in 1992 at University of Toronto in theoretical computer science. His thesis proved that certain computation problems require a given amount of time and space. He did his postdoctorate work at the ICSI in Berkeley on secure multi-media data transmission and in 1995 became an Associate Professor in the Department of Computer Science at York University, Canada. He has taught their algorithms course thirteen times to date. He has worked extensively at IIT Mumbai, India, and University of California San Diego. He is well published in the top theoretical computer science journals in topics including complexity theory, scheduling, proof systems, probability theory, combinatorics, and, of course, algorithms.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 4,55 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisVendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Etat : Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. N° de réf. du vendeur Z1-U-017-02139
Quantité disponible : 1 disponible(s)
Vendeur : dsmbooks, Liverpool, Royaume-Uni
Hardcover. Etat : Good. Good. book. N° de réf. du vendeur D7S9-1-M-0521849314-6
Quantité disponible : 1 disponible(s)