How to Think About Algorithms Paperback - Tapa blanda

Edmonds, Jeff

 
9780521614108: How to Think About Algorithms Paperback

Sinopsis

Gives insights, notations, and analogies to help students describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are included to let students test their progress, while class-tested PowerPoint slides are on the web to help course instructors.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título

9780521849319: How to Think About Algorithms Hardback

Edición Destacada

ISBN 10:  0521849314 ISBN 13:  9780521849319
Editorial: Cambridge University Press, 2008
Tapa dura