EUR 50,57
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 54,07
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New. Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
EUR 51,74
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 54,13
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 66,48
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 66,50
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 66,68
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Idioma: Inglés
Publicado por Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 65,82
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 210.
EUR 50,95
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 69,58
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Idioma: Inglés
Publicado por Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Librería: Majestic Books, Hounslow, Reino Unido
EUR 62,31
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 210.
EUR 70,44
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
EUR 71,17
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
EUR 67,32
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 58,46
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 55,70
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 55,21
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Idioma: Inglés
Publicado por Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 63,18
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 210.
EUR 72,50
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new.
EUR 80,54
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 210 pages. 9.45x6.69x0.47 inches. In Stock.
EUR 52,01
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 112,16
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. 1st edition NO-PA16APR2015-KAP.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 102,51
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. 2021. Paperback. . . . . .
Librería: Majestic Books, Hounslow, Reino Unido
EUR 112,04
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Librería: UK BOOKS STORE, London, LONDO, Reino Unido
EUR 119,32
Cantidad disponible: 3 disponibles
Añadir al carritoPaperback. Condición: New. Brand New ! Fast Delivery "International Edition " and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 4-6 Working days .and we do have flat rate for up to 2LB. Extra shipping charges will be requested This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
Idioma: Inglés
Publicado por De Gruyter, De Gruyter, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 60,87
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 113,78
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
EUR 50,97
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New. Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 129,15
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
EUR 138,20
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. Algorithms are ubiquitous in the contemporary technological world, and they ultimately consist of finite sequences of instructions used to accomplish tasks with necessary input values. This book analyses the top performing algorithms in areas as diverse as Big Data, Artificial Intelligence, Optimization Techniques and Cloud and Cyber Security Systems in order to explore their power and limitations.