The field of algorithms is now a well-established part of computer science and mathematics, with its theoretical elegance and practical importance. On the one hand, computer practitioners can directly use good algorithms in complex programming projects. On the other hand, efficient algorithms often pose a challenging mathematical problem because their analysis uses deep mathematical results from different fields. Thus the modern study of algorithms is based on an interplay between their computational and mathematical aspects. The goal of this book is to lay down foundations for this fascinating area. In keeping with this goal, we have attempted to present some of the most fundamental methods for algorithm construction. In particular, the book introduces a number of paradigms and techniques useful for designing and analyzing data structures and algorithms.
"Sinopsis" puede pertenecer a otra edición de este libro.
The field of algorithms is now a well-established part of computer science and mathematics, with its theoretical elegance and practical importance. On the one hand, computer practitioners can directly use good algorithms in complex programming projects. On the other hand, efficient algorithms often pose a challenging mathematical problem because their analysis uses deep mathematical results from different fields. Thus the modern study of algorithms is based on an interplay between their computational and mathematical aspects. The goal of this book is to lay down foundations for this fascinating area. In keeping with this goal, we have attempted to present some of the most fundamental methods for algorithm construction. In particular, the book introduces a number of paradigms and techniques useful for designing and analyzing data structures and algorithms.
Dejan ¿ivkovi¿ graduated mathematics at Belgrade University, Serbia, and he got his Ph.D. degree in computer science from Wesleyan University, Middletown, CT, USA. He is currently a Professor at Singidunum University, Serbia. His interests include algorithm complexity, graph theory, and programming languages.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Best Price, Torrance, CA, Estados Unidos de America
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9783639135046
Cantidad disponible: 4 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020188037
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L0-9783639135046
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L0-9783639135046
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783639135046_new
Cantidad disponible: Más de 20 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9783639135046
Cantidad disponible: 10 disponibles
Librería: moluna, Greven, Alemania
Kartoniert / Broschiert. Condición: New. Nº de ref. del artículo: 4960626
Cantidad disponible: Más de 20 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 380. Nº de ref. del artículo: 26128179593
Cantidad disponible: 4 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand pp. 380 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Nº de ref. del artículo: 131359318
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND pp. 380. Nº de ref. del artículo: 18128179587
Cantidad disponible: 4 disponibles